HDU4148+找规律

规律找到了就是个大水题。。

S(n)是描述S(n-1)

/*

*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<math.h>
using namespace std;
typedef long long int64;
//typedef __int64 int64;
typedef pair<int64,int64> PII;
#define MP(a,b) make_pair((a),(b)) 
const int maxn = 10005;
const int inf = 0x7fffffff;
const double pi=acos(-1.0);
const double eps = 1e-8;

char s[ maxn ],ss[ maxn ];
int ans[ 31 ];

void init(){
	ans[1] = 1;//s[ 1 ] = "1";
	ans[2] = 2;//s[ 2 ] = "11";
	ans[3] = 2;
	strcpy( s,"21" );
	for( int i=4;i<=30;i++ ){
		//printf("s=%s\n",s);
		int cnt = 0;
		strcpy( ss,s );
		int len= strlen(ss);
		for( int j=0;j<len;j++ ){
			char flag = ss[j];
			int cc = 0;
			while( flag==ss[j]&&j<len ){
				cc++;
				j++;
			}
			if( cc!=0 ){
				//j--;
				s[ cnt++ ] = cc+'0';
				s[ cnt++ ] = flag;
				if( j==len ) break;
				j--;
			}
		}
		s[cnt++] = '\0';
		ans[ i ] = strlen( s );
		//printf("ans[%d]=%d\n",i,ans[i]);
	}
}
int main(){
	init();
	int n;
	while( scanf("%d",&n),n ){
		printf("%d\n",ans[n]);
	}
	return 0;
}