Hangzhou Electric 1212--big Number

Big number

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 5961 Accepted Submission (s): 4167

Problem Descriptionas We know, Big number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate a mod B.

The problem easier, I promise that B'll be smaller than 100000.

Is it too hard? No, I work it out in the minutes, and my program contains less than lines.

Inputthe input contains several test cases. Each test case consists of positive integers A and B. The length of A would not exceed, and B would be smaller than 100000. Process to the end of file.

Outputfor Each test case, you have to ouput the result of A mod B.

Sample Input2 3 12 7 152455856554521 3250

Sample Output2 5 1521

Authorignatius.l

SOURCE Hangzhou Electric ACM Provincial Training Team Qualifying match

Recommendeddy | We have carefully selected several similar problems for you:1215 1211 1210 1214 1213//·· A ' '

1#include <stdio.h>2#include <string.h>3 Charstr[1010] ;4 intMain ()5 {6     inti, N;7      while(~SCANF ("%s%d", str, &N))8     {9         intMoD =0 ;Ten         intLen =strlen (str); One          for(i =0; i < Len; i++) AMoD = (mod *Ten+ Str[i]-'0') %N; -printf"%d\n", MoD); -     } the     return 0 ;  -}

Hangzhou Electric 1212--big Number