HUST 1379 Digits
2016-02-02 18:00
267 查看
Description
A googol written out in decimal has 101 digits. A googolplex has one plus a googol digits. That's a lot of digits! Given any number x0, define a sequence using the following recurrence:
xi+1= the number of digits in the decimal representation of xi
Your task is to determine the smallest positive i such that xi = xi-1.
Input
Input consists of several lines. Each line contains a value of x0. Every value of x0 is non-negative and has no more than one million digits. The last line of input contains the word END.
Output
For each value of x0 given in the input, output one line containing the smallest positive i such that xi = xi-1.
Sample Input
Sample Output
3
理解题意
A googol written out in decimal has 101 digits. A googolplex has one plus a googol digits. That's a lot of digits! Given any number x0, define a sequence using the following recurrence:
xi+1= the number of digits in the decimal representation of xi
Your task is to determine the smallest positive i such that xi = xi-1.
Input
Input consists of several lines. Each line contains a value of x0. Every value of x0 is non-negative and has no more than one million digits. The last line of input contains the word END.
Output
For each value of x0 given in the input, output one line containing the smallest positive i such that xi = xi-1.
Sample Input
42 END
Sample Output
3
理解题意
#include<string> #include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #include<queue> #include<map> #include<cmath> using namespace std; const int maxn = 1e6 + 5; typedef long long LL; int T, n, m; char s[maxn]; int main() { while (scanf("%s", s) != EOF) { if (s[0] == 'E') break; int cnt = 1, len = strlen(s); if (s[0] == '1'&&len == 1) { printf("%d\n", cnt); continue; } else cnt++; for (int res = 0; len != 1; cnt++) { for (int i = len; i; i /= 10) res++; len = res; res = 0; } printf("%d\n", cnt); } //while (scanf("%d", &n) != EOF){} return 0; }
相关文章推荐
- Node.js微服务+流水线服务框架的设想
- 浅析JVM及其调优(三)
- android 教程实例系列
- 11.Java 加解密技术系列之 总结
- 杀进程启动服务
- oracle 静态监听注册
- 字符串中判断只有英文字母,判断是否有忽略大小写相同的字符串
- C# 创建精简版IIS
- (2016.2.2)视频与寒假计划
- 【leetcode】Two Sum(medium)
- POJ 1010 STAMPS
- FileResult类型
- HUST 1544 R(N)
- SpringMVC4 + Spring + MyBatis3
- 查看linux服务器硬盘IO读写负载
- 【HDU】 1018 Big Number
- Ehcache分布式缓存及测试方法
- 10.Java 加解密技术系列之 DH
- Android_低功耗
- 如何处理服务器SSL收到了一个弱临时Diffie-Hellman 密钥?