Hdoj-1212-big number "Large numbers & Simple questions"

Big numberTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 6015 Accepted Submission (s): 4205


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 Input

2 312 7152455856554521 3250

Sample Output

251521

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 1695

#include <stdio.h> #include <string.h>int main () {int B;char a[1010];while (~scanf ("%s%d", a,&b)) {int Len=strlen (a), res=0; for (int i=0;i<len;++i) {res=res*10+a[i]-' 0 '; if (res>=b)  res=res%b;}     printf ("%d\n", res);} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Hdoj-1212-big number "Large numbers & Simple questions"