Improve my code: When I multiply the inputted number with 0.45392, it gives the correct answer but rounded off to whole number (with .00 as the decimals) .I need it to give the exact answer and round off to 2 decimals. Example: 6 * 0.45392 = 2.72 #include int lbtoKg(int); int lbtoKg(int weight){ int kilo; kilo = weight * 0.45392; return kilo; } int main(void){ int weight; float result; scanf("%d", &weight); result = lbtoKg(weight); printf("%.2f kgs", result); }

Improve my code: When I multiply the inputted number with 0.45392, it gives the correct answer but rounded off to whole number (with .00 as the decimals) .I need it to give the exact answer and round off to 2 decimals. Example: 6 * 0.45392 = 2.72 #include int lbtoKg(int); int lbtoKg(int weight){ int kilo; kilo = weight * 0.45392; return kilo; } int main(void){ int weight; float result; scanf("%d", &weight); result = lbtoKg(weight); printf("%.2f kgs", result); }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Can you please explain to me the error in this code? #include<stdio.h> void main() { int a[10]={1,2,3,4,5,6,7,8,9,10}, *p, *q; p=&a[1]; q=p-4; printf("%d",*q); q=p-1; printf("%d",*q); int *r; r=&a[9]; int i=r-p; int j=r+p; printf("%d",i); printf("%d", p>r); int n=9; int sum=0; for(p=&a[0]; p<=&a[9]; p++) sum+=*p; printf("%d",sum); }
Language: C Pascal’s triangle is a triangular array, useful for calculating the binomial coefficients, n k , that are used in expanding binomials raised to powers, combinatorics and probability theory. 0 0 1 0 1 1 2 0 2 1 2 2 3 0 3 1 3 2 3 3 4 0 4 1 4 2 4 3 4 4 Evaluating the values of the binomial coefficients, you get the following pattern, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 The number of the entries in each row is increased by one, as we move down. Each number in the triangle, is constructed by adding the number above it and to the left, with the number above it and to the right. The blank entries as treated as 0. Using the recursion, implement the function that computes the Pascal’s triangle. Pr
int const MULTIPLIER = 5; is a valid way to declare a constant integer variable. Group of answer choices True False ------- Given the following code segment, what is output to the screen? int num1 = 6; int num2 = 4 * num1++; cout << "num1=" << num1 << " num2=" << num2; Group of answer choices num1=7 num2=24 num1=6 num2=24 num1=6 num2=28 Nothing, because the code does not compile.
John Here Need correct java code for the following question
Find out the errors in the given code. Write the correct code and attach the output: #include <bits/stdc>using namespace std class Solution{ public: void rearrange(long *arr, int n) { int k = 0, j = n - 1, max = arr[n - 1] + 1; for (int i = 0; i < += 2) ) * max; for (int i = 1; i < n; i += 2) arr[i] += (arr[k++] % max) * max; for (int i = 0; i < n; i++) arr[i] /= m { int t; cin >> t; while(t--){ cin >> n; long long arr[n]; for(int i = 0;i<n;i++){ } Solution ob; ob rearrange(arr, n); for (int i = 0; i < n; +) cout << arr[i] << " "; return 0; }
What is the final value of x when the following code is run? int x;for(x =1; x<20; x+=2) {}
What is wrong with the following code? int *p;. //Line 1int *q;. //Line 2 p = new int [5];. //Line 3 *p = 2; //Line 4 for (int i = 1; i < 5; i++). //Line 5p[i] = p[i-1] + i;. //Line 6 q = p;. //Line 7 delete [] p; //Line 8 for (int j = 0; j < 5; j++) //Line 9 cout << q[j] << " "; //Line 10 cout << endl; //Line 11
Question 1 Work your way through the following code fragments. What would be printed? a) int i = -23; int * p = &i; printf("*p = %i\n", *p); b) int i; int * p = &i; printf("*p = %i\n", *p); c) int i = 48; int * p; printf("*p = %i\n", *p); d) int i = 10;int * p = &i;int j; j = ++*p; printf("j = %i\n", j);printf("i = %i\n", i); e) int i = 10, j = 20;int * p = &i;int * q = &j; *p = *q;printf("i = %i, j = %i\n", i, j);printf("*p = %i, *q = %i\n", *p, *q); i = 10; j = 20; p = q;printf("i = %i, j = %i\n", i, j);printf("*p = %i, *q = %i\n", *p, *q);
Consider the following code segment: for(int i = 0; i < 20; i++) Z [i] = i % 2; How many values of Z are 1?
What is the the output of the following code? int **p;p = new int* [5];for (int i = 0; i < 5; i++)p[i] = new int[3];for (int i = 1; i < 5; i++) for (int j = 0; j < 3; j++)p[i][j] = 2 * i + j;for (int i = 1; i < 5; i++){for (int j = 0; j < 3; j++)cout << p[i][j] << " ";cout << endl;}
What is my mistake in here? #include <stdio.h>#include <math.h>#include <stdlib.h>int dist(double x1, double y1, double z1, double x2, double y2, double z2){double d;d=sqrt(pow(x2-x1,2) + pow(y2-y1,2) + pow(z2-z1,2));printf("%f",d);return 0;}int (int argc, int char* argv[]){if(argc>6)printf("Extra arguments entered \n");else if(argc<6)printf("Some arguments are missing \n");elsedist(atof(argv[1]), atof(argv[2]), atof(argv[3]), atof(argv[4]), atof(argv[5]), atof(argv[6]));return 0;}
This Code print the first occurrences of x, Modify the code to print the last occurrences of x and print how many times it exists? ( with explanation for each line if possible) many thanks.