登 录
POJ 2591 Set Definition
算是简单题了,
双迭代
#include <iostream> #include <algorithm> using namespace std; long s[10000005]; int main() { int i,j,k,m,n,t; s[0] = 1; j = 0; k=1; i=0; for (;k<=10000000;) { if (s[i]*2+1 < s[j]*3+1) { s[k] = s[i]*2+1; k++; i++; } else if (s[i]*2+1 > s[j]*3+1) { s[k] = s[j]*3+1; k++; j++; } else i++; } while (scanf("%d",&n)!=EOF) { printf("%d/n",s[n-1]); } return 0; }
抱歉!评论已关闭.