ZOJ-1954
2014-04-28 20:00
274 查看
又是无意中瞄到的水题,顺手A之,模拟下硬搞就行,无算法纯找规律
#include<stdio.h> int main() { int dir[6][2] = { { -1, 1 }, { -1, 0 }, { 0, -1 }, { 1, -1 }, { 1, 0 }, { 0, 1 } }; int x[100000], y[100000]; x[1] = y[1] = 0; int index = 2, i, j, circle = 1; while (index < 100000) { x[index] = x[index - 1] + dir[5][0]; y[index] = y[index - 1] + dir[5][1]; index++; for (i = 0; i < circle - 1 && index < 100000; i++) { x[index] = x[index - 1] + dir[0][0]; y[index] = y[index - 1] + dir[0][1]; index++; } for (j = 1; j < 6 && index < 100000; j++) for (i = 0; i < circle && index < 100000; i++) { x[index] = x[index - 1] + dir[j][0]; y[index] = y[index - 1] + dir[j][1]; index++; } circle++; } while (scanf("%d", &i) != EOF) printf("%d %d\n", x[i], y[i]); return 0; }
相关文章推荐
- zoj 2107 Quoit Design
- ZOJ-3023
- zoj 3316 Game(带花树+完美匹配)
- ZOJ-3785 What day is that day?
- ZOJ1134 POJ1463 HDU1054 Strategic Game, 树形DP
- ZOJ-2173
- ZOJ 3058 Circle and Ring(圆和圆环的相交面积)
- ZOJ 2417 Lowest Bit
- POJ1062 昂贵的聘礼, ZOJ1245 Best Deal
- zoj1789(并查集)
- ZOJ 1003
- ZOJ 3471 状压DP
- 【有根树的同构】ZOJ 1990/POJ 1635
- FJSDFZOJ 1109 统计数字
- zoj 3329 One Person Game(概率DP基础)
- ZOJ 2343 Robbers(思路)
- ZOJ 2416题解BFS
- [字符串]FJSDFZOJ 1134 整数去位
- ZOJ 1008
- ZOJ 2339 Hyperhuffman(Huffman编码)