Calculating Modulo between 2 large numbers represented as strings

Asked Feb 17 '19 at 13:05

Active Feb 17 '19 at 17:02

Viewed 329 times

I am trying to compute % of large numbers. I managed so far with the dividend to be large and the mod represented as integer. I have no idea how to do otherwise. I need this exactly for Large numbers division that is why I need this. No, I will not use BigInts library, as it is not accepted by online judges. Moreover, I'd like to know how to do it myself.

This is what I have written for just one large number.

int mod(string num, int a) 
{ 
int res = 0; 

for (int i = 0; i < num.length(); i++) 
     res = (res*10 + (int)num[i] - '0') %a; 

return res; 
}

edited Feb 17 '19 at 17:02

HariUserX

1,341
1
9
17

asked Feb 17 '19 at 13:05

Prekzursil

8

You would basically do the same as when dividing two numbers with pen and paper. – πάντα ῥεῖ Feb 17 '19 at 13:10
2

What is the meaning of the list of languages you tagged? Do you want an answer which applies to all of them? Do you want one answer for each of the languages? – Yunnosch Feb 17 '19 at 13:11
@Rotem Bllind me. Thanks. – Yunnosch Feb 17 '19 at 13:20
2

This is for some kind of competition? It seems a bit of a cheat to ask SO to solve that for you. – David Hoelzer Feb 17 '19 at 13:37
2

Unless we're to receive the resulting credit! – Lightness Races in Orbit Feb 17 '19 at 17:04
What is the limit on the number of digits in `num` and `a`? – HariUserX Feb 17 '19 at 18:30
Learning purposes, the limit is 64mb of data. – Prekzursil Feb 17 '19 at 19:35

Calculating Modulo between 2 large numbers represented as strings

0 Answers0