uva 10161-棋盘上的蚂蚁
2013-02-11 19:33
218 查看
#include <stdio.h>
#include <math.h>
int main()
{
int x,n;
scanf("%d",&x);
while(x!=0)
{
int i,j;
for(int k=0;k<sqrt((double)x)+10;k++)
{
if(k>=sqrt((double)x)&&k<sqrt((double)x)+1)
{
n=k;
break;
}
}
if(n%2==0)
{
if(x-(n-1)*(n-1)<=n)
{
j=n;
i=x-(n-1)*(n-1);
}
else
{
i=n;
j=2*n+(n-1)*(n-1)-x;
}
}
else
{
if(x-(n-1)*(n-1)<=n)
{
i=n;
j=x-(n-1)*(n-1);
}
else
{
j=n;
i=2*n+(n-1)*(n-1)-x;
}
}
printf("%d %d\n",i,j);
scanf("%d",&x);
}
return 0;
}
#include <math.h>
int main()
{
int x,n;
scanf("%d",&x);
while(x!=0)
{
int i,j;
for(int k=0;k<sqrt((double)x)+10;k++)
{
if(k>=sqrt((double)x)&&k<sqrt((double)x)+1)
{
n=k;
break;
}
}
if(n%2==0)
{
if(x-(n-1)*(n-1)<=n)
{
j=n;
i=x-(n-1)*(n-1);
}
else
{
i=n;
j=2*n+(n-1)*(n-1)-x;
}
}
else
{
if(x-(n-1)*(n-1)<=n)
{
i=n;
j=x-(n-1)*(n-1);
}
else
{
j=n;
i=2*n+(n-1)*(n-1)-x;
}
}
printf("%d %d\n",i,j);
scanf("%d",&x);
}
return 0;
}
相关文章推荐
- UVa Problem 10161 Ant on a Chessboard (棋盘上的蚂蚁)
- UVa 10161 棋盘上的蚂蚁
- UVa_OJ 10161 棋盘上的蚂蚁
- UVa 10161 棋盘上的蚂蚁
- UVA 10161 棋盘上的蚂蚁
- 蚂蚁-UVA 10881 - Piotr's Ants
- UVA 10161-Ant on a Chessboard
- Uva 10881 Piotr’s Ants 蚂蚁
- UVa 10161 Ant on a Chessboard
- Uva 10161 - Ant on a Chessboard
- uva 10161 - Ant on a Chessboard
- UVa 10161 Ant on a Chessboard
- UVa 10161 Ant on a Chessboard
- uva 10161 - Ant on a Chessboard
- UVa 861 Little Bishops(棋盘放棋)
- UVA 10714 蚂蚁贪心
- UVA 10161 Ant on a Chessboard
- UVA 10161 Ant on a Chessboard
- uva 10161 Ant on a Chessboard(数学推规律)
- 蚂蚁(uvalive 4043)