// Exercise 3.25 Solution #include <iostream> using std::cout; using std::endl;
ID: 3615060 • Letter: #
Question
// Exercise 3.25 Solution #include <iostream>using std::cout; using std::endl; using std::cin;
#include <iomanip> using std::setw;
int quotient( int, int ); int remainder( int, int );
int main() { int number, divisor = 10000;
cout << "Enter an integer between 1 and 32767:"; cin >> number;
cout << "The digits in the number are: ";
while ( number >= 1 ) {
if ( number >= divisor ) { cout << setw( 3 ) << quotient( number,divisor ); number = remainder( number, divisor ); divisor = quotient( divisor, 10 ); } else divisor = quotient( divisor, 10 ); }
cout << endl;
return 0; }
// Part A: determine quotient using integerdivision int quotient( int a, int b ) { return a / b; }
// Part B: determine remainder using the modulusoperator int remainder( int a, int b ) { return a % b; } // Exercise 3.25 Solution #include <iostream>
using std::cout; using std::endl; using std::cin;
#include <iomanip> using std::setw;
int quotient( int, int ); int remainder( int, int );
int main() { int number, divisor = 10000;
cout << "Enter an integer between 1 and 32767:"; cin >> number;
cout << "The digits in the number are: ";
while ( number >= 1 ) {
if ( number >= divisor ) { cout << setw( 3 ) << quotient( number,divisor ); number = remainder( number, divisor ); divisor = quotient( divisor, 10 ); } else divisor = quotient( divisor, 10 ); }
cout << endl;
return 0; }
// Part A: determine quotient using integerdivision int quotient( int a, int b ) { return a / b; }
// Part B: determine remainder using the modulusoperator int remainder( int a, int b ) { return a % b; }
Explanation / Answer
please rate - thanks // Exercise 3.25 Solution #include #include int quotient( int, int ); int remainder( int, int ); int main() { int number, divisor = 10000; printf("Enter an integer between 1 and 32767: "); scanf("%d",&number); printf("The digits in the number are: "); while ( number >= 1 ) { if ( number >= divisor ) { printf("%3d", quotient( number, divisor )); number = remainder( number, divisor ); divisor = quotient( divisor, 10 ); } else divisor = quotient( divisor, 10 ); } printf(" "); getch(); return 0; } // Part A: determine quotient using integer division int quotient( int a, int b ) { return a / b; } // Part B: determine remainder using the modulus operator int remainder( int a, int b ) { return a % b; }Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.