HDU-1212 Big Number

来源：互联网发布：apk 反编译拿到源码编辑：程序博客网时间：2024/04/27 23:26

Big Number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8022 Accepted Submission(s): 5535

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 312 7152455856554521 3250

Sample Output

Author

Ignatius.L

Source

杭电ACM省赛集训队选拔赛之热身赛

Recommend

Eddy

Statistic | Submit | Discuss | Note

前面的数对后面的数取余

AC代码：

#include<iostream>#include<cstring>using namespace std;char str[1100];int main(){long m,n,i,j;while(cin>>str){cin>>n;j=strlen(str);m=0;for(i=0;i<j;i++){m=m*10+str[i]-'0';m%=n; }cout<<m<<endl;}return 0;}#include<iostream>#include<cstring>using namespace std;char str[1100];int main(){long m,n,i,j;while(cin>>str){cin>>n;j=strlen(str);m=0;for(i=0;i<j;i++){m=m*10+str[i]-'0';m%=n; }cout<<m<<endl;}return 0;}

0 0

apk 反编译拿到源码

原创粉丝点击

热门问题 老师的惩罚人脸识别我在镇武司摸鱼那些年重生之率土为王我在大康的咸鱼生活盘龙之生命进化天生仙种凡人之先天五行春回大明朝姑娘不必设防，我是瞎子香菇滑鸡煲仔饭滑鸡粥滑溜鸡片滑鸡的做法脚滑鸡解说嫩滑鸡肉丸虫草花蒸滑鸡鸡胸脯怎么炒又滑又嫩黄花菜蒸滑鸡香菇滑鸡粥的做法滑炒鸡片正宗做法清蒸滑鸡的做法大全蒸滑鸡的做法香菇滑鸡饭图片香菇滑鸡的做法香菇鸡煲仔饭滑鼠蛇滑鼠有线鼠标鼠标品牌排行榜鼠标鼠标什么牌子好鼠标多少钱电脑鼠标鼠标买什么牌子的好无线鼠标多少钱鼠标品牌排行鼠标品牌鼠标牌子鼠标吧鼠标推荐鼠标图片鼠标价格鼠标价格一般多少滔滔博联滔滔天不滔滔组词滔博运动