0

Help!!!!!

Let the numbers be M and N. The method to obtain the quotient and the remainder is by successive subtraction; The method would be to successively subtract the divisor of the dividend until obtaining a result less than the divisor, which will be the remainder of the division; the number of subtractions made will be the quotient. Example: M = 50 N=13 50 - 13 = 37 C =1 37 - 13 = 24 C=2 24 - 13 = 11 C=3 Since 11 is less than the divisor 13, the successive subtractions will be completed and then 11 will be the remainder (remainder) and 3 (number of subtractions) the quotient. Note: Sentinel value. It is the one that is totally different from all the possible values ​​of the list that is being read and in this way serves to indicate the end of the list.

26th Mar 2021, 3:32 AM
Uriel
5 Antworten
0
is in C++
26th Mar 2021, 3:32 AM
Uriel
0
ready man
26th Mar 2021, 4:34 AM
Uriel
0
Uriel Show your attempt also write clear description of problem in your code
26th Mar 2021, 10:12 AM
R🍁🇮🇳
R🍁🇮🇳 - avatar
0
The truth does not come out, I am programming it in DevC ++ I need help
27th Mar 2021, 9:35 AM
Uriel
0
I can't solve it, I'm new to this
27th Mar 2021, 9:36 AM
Uriel