HDU1212:Big Number
来源:互联网 发布:activiti java 代码 编辑:程序博客网 时间:2024/05/01 22:56
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
大数对小数取余的模板题
#include <stdio.h>#include <string.h>int mod(char *n1,int n2){ int tmp=0; int len=strlen(n1); for(int i=0; i<len; i++) { tmp=tmp*10+n1[i]-'0'; tmp=tmp%n2; } return tmp;}int main(){ char s[100000]; int n; while(~scanf("%s%d%*c",s,&n)) { printf("%d\n",mod(s,n)); } return 0;}
- HDU1212:Big Number
- hdu1212 Big Number
- HDU1212 BIG NUMBER (MOD)
- Big Number HDU1212
- hdu1212 Big Number
- HDU1212 Big Number 解题报告
- hdu1212 Big Number,大数求模
- HDU1212 Big Number 【同余定理】
- HDU1212:Big Number(大数求模)
- HDU1212 Big Number【大数+模除】
- HDU1212 Big Num
- hdu1212 Big Number &第六届山东省赛Single Round Math (同余定理,大数取模)
- hdu1212
- HDU1212
- big big number 求和
- big number
- Big Number
- Big Number
- 四大图像库OpenCV/FreeImage/CImg/CxImage简述
- 在linux系统中用pkill命令踢出在线登录用户
- 杭电2159背包问题!
- 正则表达式
- Uva 10924 - Prime Words
- HDU1212:Big Number
- onInterceptTouchEvent和onTouchEvent调用时序
- devexpress 延长试用期
- Sencha Touch 2 Global Variable
- 关于以太网帧中标签的解释
- 【设计模式】之十一Visitor
- vs2008快捷键
- Edge Detection: Sobel operator
- oracle备份操作