hdoj-1212-Big Number【大数取余&简单题】

发布时间:2017-7-1 11:08:29编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"hdoj-1212-Big Number【大数取余&简单题】 ",主要涉及到hdoj-1212-Big Number【大数取余&简单题】 方面的内容,对于hdoj-1212-Big Number【大数取余&简单题】 感兴趣的同学可以参考一下。

Big Number

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


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.


上一篇:nginx配置location总结及rewrite规则写法
下一篇:Ionic 2 官方示例程序 Super Starter

相关文章

相关评论

本站评论功能暂时取消,后续此功能例行通知。

一、不得利用本站危害国家安全、泄露国家秘密,不得侵犯国家社会集体的和公民的合法权益,不得利用本站制作、复制和传播不法有害信息!

二、互相尊重,对自己的言论和行为负责。

最近更新

好贷网好贷款