programming-challenges Ones (110504) 题解
来源:互联网 发布:防水纹身贴淘宝 编辑:程序博客网 时间:2024/05/19 17:49
这道题也看了参考答案,主要的思路是利用了模运算可以分解的性质,从而避免了运算溢出的问题。思路可以参看:http://www.tuicool.com/articles/rEZriy
代码:
#include <iostream>#include <sstream>#include <fstream>#include <string>#include <vector>#include <queue>#include <map>#include <set>#include <stack>#include <assert.h>#include <algorithm>#include <math.h>#include <ctime>#include <functional>#include <string.h>#include <stdio.h>#include <numeric>#include <float.h>using namespace std;int main() {int i = 0; while (cin >> i) {int temp = 1; int ans = 1; do {if (temp % i == 0) break;ans++; temp = (temp * (10 % i) + 1) % i; } while (true);cout << ans << endl; }return 0; }
0 0
- programming-challenges Ones (110504) 题解
- programming-challenges WERTYU (110301) 题解
- programming-challenges ShellSort (110407) 题解
- programming-challenges Chopsticks (111107) 题解
- programming-challenges Bicoloring (110901) 题解
- programming-challenges Crypt Kicker (110204) 题解
- programming-challenges Stack 'em Up (110205) 题解
- programming-challenges Poker Hands (110202) 题解
- programming-challenges Contest Scoreboard (110207) 题解
- programming-challenges Where's Waldorf? (110302) 题解
- programming-challenges Common Permutation (110303) 题解
- programming-challenges Crypt Kicker II (110304) 题解
- programming-challenges Automated Judge Script (110305) 题解
- programming-challenges File Fragmentation (110306) 题解
- programming-challenges Vito's Family (110401) 题解
- programming-challenges Stacks of Flapjacks (110402) 题解
- programming-challenges Longest Nap (110404) 题解
- programming-challenges Shoemaker's Problem (110405) 题解
- hdu 1875 畅通工程再续(kruskal算法计算最小生成树)
- The Pilots Brothers' refrigerator-DFS路径打印
- 【阅读】《head first html5》第四章——javascript函数和对象
- Android实战简易教程-第二十二枪(基于Baas的用户注册功能)
- 浅谈BFC和IFC
- programming-challenges Ones (110504) 题解
- 嵌入式linux之定时器防抖
- 2014.4新版uboot启动流程分析
- Servlet一个最简单的例子(一)
- 计蒜客第22题---排序后的数组删除重复数字
- Python入门教程-13 for-in
- 【伸展树】sgu311
- Android布局管理器
- 2015 Multi-University Training Contest 1 Hdu5295 unstable