#include<stdio.h>
#define Min(a, b) ((a)<(b)?(a):(b))
#define N 10000001
long f[N];
int main()
{
	int n,i;
	int x_2 = 1,x_3 = 1;
	f[x_2] = 1;
	f[x_3] = 1;
	for(i=2; i<=10000000; i++)
	{
		f[i] = Min(f[x_2]*2+1, f[x_3]*3+1);
		
		if(f[i] == f[x_2]*2+1)
			x_2++;
		if(f[i] == f[x_3]*3+1)
			x_3++;
	}
	while(scanf("%d",&n) != EOF)
	{
		printf("%ld\n",f[n]);
	}
	return 0;
}

• Re:从过1338的大牛那里学到的解法... 很牛叉，直接水过（附上代码） (23) jimoran 2011-02-13 16:52:17
  • Re:从过1338的大牛那里学到的解法... 很牛叉，直接水过（附上代码） (27) 30443 2011-07-19 18:55:41