Question

Programming (please provide typeset):

given an integer dividend x>0 and an integer divisor y>0, find the quotient Q and the remainder R of the integer division of x by y without using division. Note: x=Q*y+R

Requirement: ask the user input the integers x, y>0: print out the quotient Q and remainder R

language: C++

Please explain how you got the code

Answer 1

#include <iostream>

using namespace std;

int main() {
        int x, y;

        cout << "Enter number x: ";
        cin >> x;
        cout << "Enter divisor y: ";
        cin >> y;

        int quotient = 0, remainder;

        // While x is greater than y, Keep reducing x.
        // At the end, whatever is remaining in x, is remainder
        while(x > y) {
                x = x - y;
                quotient += 1;
        }

        remainder = x;

        cout << "Quotient: " << quotient << endl;
        cout << "Remainder: " << remainder << endl;
}

**************************************************

Thanks for your question. We try our best to help you with detailed answers, But in any case, if you need any modification or have a query/issue with respect to above answer, Please ask that in the comment section. We will surely try to address your query ASAP and resolve the issue.

Please consider providing a thumbs up to this question if it helps you. by Doing that, You will help other students, who are facing similar issue.