UVA 11879 multiple 17(大数取模)
2013-11-26 09:33
162 查看
题目:就是判断这个数是否为17的倍数
题目总结:对取模运算有多了一层印象
题目总结:对取模运算有多了一层印象
#include<cstdio> #include<cstdlib> #include<string> #include<iostream> #include<algorithm> using namespace std; int main() { string str; int i,ans; while(getline(cin,str)&&str[0]!='0') { ans=0; for(i=0;i<str.length();i++) ans=(ans*10+str[i]-'0')%17; printf("%d\n",ans==0); } }
相关文章推荐
- uva 11879 - Multiple of 17
- UVa 11879 - Multiple of 17
- UVa 11879 - Multiple of 17
- UVA 11879 Multiple of 17
- uva 11879 Multiple of 17
- UVA128 - Software CRC(大数取模)
- UVA 10494 - If We Were a Child Again(大数除法和取模)
- UVA If We Were a Child Again(大数相除模板)
- hdu 1023 Train Problem II(catalan 大数)uva 10303 uva 991
- uva10069 - Distinct Subsequences(动规,大数)
- poj The Embarrassed Cryptographer(大数取模)(同余模定理)
- UVA 10328(DP,大数,至少连续)
- Uva 10494 - If We Were a Child Again(大数相除)
- uva 424 大数相加
- hdu1212(大数取模) java版本
- UVA 10328 - Coin Toss dp+大数
- 【习题 8-17 UVA - 11536】Smallest Sub-Array
- Uva 10497 - Sweet Child Makes Trouble 解题报告(递推+大数)
- UVA 10106 Product (大数相乘)
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推