【HDOJ】1329 Hanoi Tower Troubles Again!
2015-01-15 20:52
204 查看
水题,搞清楚hanoi的定义就好做了。
/* 1329 */ #include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #define MAXN 55 int b[MAXN]; int a[MAXN]; bool isSquare(int x) { int y = (int) sqrt(x*1.0); return y*y == x; } void init() { int i, j, k; int n = 1; bool flag; memset(b, 0, sizeof(b)); for (i=1; ; ++i) { flag = true; for (j=0; j<n; ++j) { if (b[j]==0 || isSquare(b[j]+i)) { flag = false; b[j] = i; break; } } if (flag) { a = i-1; b[n++] = i; if (n > 50) break; } } } int main() { int t, n; #ifndef ONLINE_JUDGE freopen("data.in", "r", stdin); #endif init(); scanf("%d", &t); while (t--) { scanf("%d", &n); printf("%d\n", a ); } return 0; }
相关文章推荐
- hdu 1329 Hanoi Tower Troubles Again!
- HDU1329 Hanoi Tower Troubles Again!——S.B.S.
- HDU 1329 Hanoi Tower Troubles Again!(乱搞)
- HDU 1329 Hanoi Tower Troubles Again!
- zoj1239 Hanoi Tower Troubles Again!
- uva10276 hanoi tower troubles again
- zoj 1239 Hanoi Tower Troubles Again!
- UVa Problem 10276 Hanoi Tower Troubles Again! (汉诺塔卷土重来!)
- UVA 10276 - Hanoi Tower Troubles Again!
- (挑战编程_9_8)Hanoi Tower Troubles Again!
- UVa10276 HDU1329 ZOJ1239 Hanoi Tower Troubles Again!【递推函数+打表】
- ZOJ 1239 Hanoi Tower Troubles Again!
- zoj 1239 Hanoi Tower Troubles Again!
- Uva-10276-Hanoi Tower Troubles Again!
- joj 1031 Hanoi Tower Troubles Again!解题报告
- ZOJ1239 Hanoi Tower Troubles Again!
- Hanoi Tower Troubles Again! ZOJ - 1239
- zoj 1239 Hanoi Tower Troubles Again! 题解Orz
- Hanoi Tower Troubles Again! (找规律)
- zoj 1239 Hanoi Tower Troubles Again!