HDOJ 5832 A water problem(高精度 大数取模)
来源:互联网 发布:淘宝网微淘 编辑:程序博客网 时间:2024/06/04 00:38
A water problem
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 826 Accepted Submission(s): 428
Problem Description
Two planets named Haha and Xixi in the universe and they were created with the universe beginning.
There is73 days in Xixi a year and 137 days in Haha a year.
Now you know the daysN after Big Bang, you need to answer whether it is the first day in a year about the two planets.
There is
Now you know the days
Input
There are several test cases(about 5 huge test cases).
For each test, we have a line with an only integerN(0≤N) , the length of N is up to 10000000 .
For each test, we have a line with an only integer
Output
For the i-th test case, output Case #i: , then output "YES" or "NO" for the answer.
Sample Input
100010333
Sample Output
Case #1: YESCase #2: YESCase #3: NO
Author
UESTC
Source
2016中国大学生程序设计竞赛 - 网络选拔赛
思路:
这道题的题意很清楚,就是让你求73和137的的公倍数。因为73和137的最小公倍数是10001,所以其实也就是求这个数能不能模10001余0。但是由于输入的数是10000000位的数,用long long来装是肯定不行的,所以考虑用高精度。套用一个大数取余的模板
就可以。这里选择手动大数取模。
代码:
#include<iostream> #include<string> #include<cstdio> int const maxn=10000000+5; char str[maxn]; using namespace std; int main(){ //freopen("in.txt","r",stdin); int t=0; while(scanf("%s",str)!=EOF) { t++; int i; int rem=0; for(i=0;str[i];i++){ rem=rem*10+str[i]-'0'; rem=rem%10001; } printf("Case #%d: ",t); if(rem==0) printf("YES\n"); else printf("NO\n"); } }
0 0
- HDOJ 5832 A water problem(高精度 大数取模)
- HDOJ 5832 a water problem(大数取模)
- HDU 5832 A water problem (大数取模)
- A water problem--------大数取模
- A water problem(大数取模)
- hdu 5832 A water problem(大数取模)
- hdu 5832 A water problem 大数取模问题 大水
- HDU 5832 A water problem 【大数取模,Java 大数也不是万能的。。】
- hdu 5832 A water problem【大数取膜】
- HDU 5832:A water problem (大数整除)
- HDU 5832 A water problem【大数问题】
- HDU-5832 A water problem(特殊的取模方法)
- HDU 5832 A water problem(取模~)—— 2016中国大学生程序设计竞赛 - 网络选拔赛
- 大数(高精度)加减乘除取模运算
- AOJ152 A X B problem(大数相乘、高精度乘法)
- hdu5832 A water problem (大数求余)
- 大数(高精度)加减乘除取模
- HDOJ 1002 A + B Problem II(大数A+B)
- [Spark2.0]ML piplines管道模式
- 正则表达式-匹配
- Servlet Note
- 把lua的gc移到独立线程
- HDU 3605 Escape(网络流 + 状压简化 )
- HDOJ 5832 A water problem(高精度 大数取模)
- nginx配置转发
- jquery学习笔记
- Hadoop 新 MapReduce 框架 Yarn 详解
- SumatraPDF与tex反向搜索
- wifi 获取bssid,ssid,rssi
- css3 中 margin-top使用的注意点
- hdoj 5834 Magic boy Bi Luo with his excited tree 树形dp
- 《你永远都无法叫醒一个装睡的人》经典语录