求余<hdoj1212>
来源:互联网 发布:芜湖java培训 编辑:程序博客网 时间:2024/05/17 20:29
Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7179 Accepted Submission(s): 4959
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 312 7152455856554521 3250
Sample Output
251521
Author
Ignatius.L
#include<cstdio>#include<cstring>char a[10001];int main(){int b,n,m;while(scanf("%s",&a)!=EOF){ scanf("%d",&b); int n=strlen(a); int yu=0; for(int i=0;i<n;i++ ) { yu=yu*10; yu=yu+a[i]-'0'; yu=yu%b; } printf("%d\n",yu);}return 0;}
0 0
- 求余<hdoj1212>
- hdoj1212(大数取余)Big Number
- hdoj1212
- 求余
- 求余
- 求余
- 求余
- 求余
- 求模 求余
- 求余逆运算+负数求余
- 大数求余(String求余)
- JAVA中的求余
- 求余不用模
- 大数求余
- 数一数二之求余
- 求余不用模
- 求余运算幢错一
- 求余运算
- mpi学习日志(3):mpi4py与广播
- 我的linux菜鸟之路2
- android recycleView的进一步封装
- 关于bootstrap-datetimepicker 插件的配置参数详解
- angular的watch监听
- 求余<hdoj1212>
- java中equal和==的比较
- android 标题栏不显示?
- 动态代理 InvocationHandler中的invoke()方法是在哪被调用的
- 关于函数的多态,与继承,以及相关的名词
- mac 下自动化测试appium环境搭建,以及应用
- Android Studio 安装程序Error type 3 :class do not exits
- Java--第10章--网络(学习小笔记)
- Foundation构架秘籍