11687 - Digits

最新推荐文章于 2020-02-27 08:45:42 发布

LILI-XU

最新推荐文章于 2020-02-27 08:45:42 发布

阅读量1.5k

点赞数 1

分类专栏： UVa Online Judge

本文链接：https://blog.youkuaiyun.com/felixtsui/article/details/8977529

版权

UVa Online Judge 专栏收录该内容

112 篇文章

订阅专栏

本文介绍了一个有趣的数字序列问题：从任意正整数开始，通过计算该数的十进制位数来形成新的序列，并探讨了找到序列中重复数字的最小位置的方法。文章提供了完整的算法实现，包括输入处理、递归函数设计及输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem D: Digits

A googol written out in decimal has 101 digits. A googolplex hasone plus a googol digits. That's a lot of digits!

Given any number x₀, define a sequenceusing the following recurrence:

x_i+1 = the number of digits in the decimal representation of x_i

Your task is to determine the smallest positive i such thatx_i = x_i-1.

Input Specification

Input consists of several lines. Each line contains avalue of x₀. Every value of x₀is non-negative and has no more than one million digits.The last line of input containsthe word END.

Sample Input

42
END

Output Specification

For each value of x₀ given in the input, outputone line containing the smallest positive i such that x_i = x_i-1.

Output for Sample Input

#include<stdio.h>
#include<string.h>
char a[10000010];
int p;
int solve(int x)
{ 
	int y;
	sprintf(a,"%d",x);
	y=strlen(a);
	p++;
	if(x==y) return p;
	solve(y);
}
int main()
{
	while(gets(a)){
		p=1;
		if(strcmp(a,"END")==0) break;
		else if(strcmp(a,"1")==0) puts("1");
		else printf("%d\n",solve(strlen(a)));
	}
	return 0;
}