Big number
Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 5606 Accepted Submission (s): 3903
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 this is the search on the Internet should remember the conclusion:a*b% C = (a%c * b%c)%c
(a+b)%c = (a%c + b%c)%c
#include <iostream> #include <stdio.h> #include <string.h>using namespace Std;int main () { char ls [1004];int N; while (scanf ("%s%d", Ls,&n)!=eof) { int sum=0; for (int i=0;i<strlen (LS); i++) { sum= (sum*10+ (ls[i]-' 0 ')%n)%n; } cout<<sum<<endl; } return 0;}
Hangzhou Electric HDU ACM 1212 Big number
