码迷,mamicode.com
首页 > 其他好文 > 详细

Big Number(大数)

时间:2015-06-26 17:42:32      阅读:118      评论:0      收藏:0      [点我收藏+]

标签:

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5857    Accepted Submission(s): 4093
点我

Problem Description
As 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.

To make the problem easier, I promise that B will be smaller than 100000.

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

 

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

 

Output
For each test case, you have to ouput the result of A mod B.
 

 

Sample Input
2 3
12 7
152455856554521 3250
 
Sample Output
2
5
1521
 1 #include <iostream>
 2 #include <cstring>
 3 using namespace std;
 4 int main()
 5 {
 6     int n,i,j;
 7     char a[1002];
 8     while(cin>>a>>n)
 9     {
10         int count=0,c=0,m=0;
11         count=strlen(a)-1;
12         for(i=0;i<=count;i++)
13         {
14             m=a[i]-0+c*10;
15             c=m%n;
16         }
17         cout<<c<<endl;
18         memset(a,0,sizeof(a));
19     }
20 }

 

Big Number(大数)

标签:

原文地址:http://www.cnblogs.com/a1225234/p/4602731.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!