HDU 1212 Big Number 【大数求余模拟】
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.
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
View Code
1、腾讯云网站解决方案专享特惠一站式上云热门云产品低至3折
2、清华朱文武团队斩获NIPS2018AutoML挑战赛亚军，高校排名第一
3、印度多家银行寻求利用人工智能提高业务能力
4、快手为何能成为现象级产品？还原2017年最火短视频背后的商业逻辑
5、IoT与智能时代｜商业洞见
#include<stdio.h>优质内容筛选与推荐>>
#include<string.h>
int main()
{
int n,i,res;
char s[1004];
while(scanf("%s%d",s,&n)!=EOF)
{
res=0;
for(i=0;s[i];i++)
res=(res*10+s[i]-'0')%n;
printf("%d\n",res);
}
return 0;
}
1、腾讯云网站解决方案专享特惠一站式上云热门云产品低至3折
2、清华朱文武团队斩获NIPS2018AutoML挑战赛亚军，高校排名第一
3、印度多家银行寻求利用人工智能提高业务能力
4、快手为何能成为现象级产品？还原2017年最火短视频背后的商业逻辑
5、IoT与智能时代｜商业洞见