UVA10161Ant on a Chessboard

題意：找出所給數位座標

思路：對角線上的數符合a = n * (n - 1) + 1，然後從奇偶行的數與對角線上的數的大小關係，推出座標

 

#include<stdio.h>#include<math.h>void found(int x){int m = ceil(sqrt(x));int num = m * (m - 1) + 1;if (m % 2 == 0){if(x < num)printf("%d %d\n", m - (num - x), m);elseprintf("%d %d\n", m, m - (x - num));}else{if(x < num)printf("%d %d\n", m, m - (num - x));elseprintf("%d %d\n", m - (x - num), m);}}int main(){int n;while (scanf("%d", &n) && n)found(n);return 0;}