UVA - 10161 Ant on a Chessboard
来源:互联网 发布:宽带网络布线 编辑:程序博客网 时间:2024/05/17 08:52
题目大意:给一个棋盘,输入n,找出n在第几行第几列。
解题思路:找规律。先求最近的完全平方数,得到相应坐标,求 n 与该平方数的差得到 n 的坐标。
#include<iostream> #include<cstdio>#include<string.h>#include<stdlib.h>#include<cmath>using namespace std;int main() { long long N; while(scanf("%lld", &N) != EOF && N) { int x = 0, y = 0; long long n = floor(sqrt(N) + 0.5); if (n % 2 == 0) { x = n; y = 1; if (N < n * n) y = y + n * n - N; else if (N > n * n) { x++; y = N - n * n; } } else { y = n; x = 1; if (N < n * n) x = x + n * n - N; else if (N > n * n) { y++; x = N - n * n; } } printf("%d %d\n", x, y); } return 0; }
1 0
- 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 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 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
- 省市区三级联动
- 使用GitLab时SSH配置
- 数据结构学习笔记(四)队列及其C++实现
- Android 无法关联Api-23源码的解决办法
- 软件调试学习摘录
- UVA - 10161 Ant on a Chessboard
- HTTP: POST PUT
- 标准光源箱的使用方法和注意事项
- UESTC - 994 两个圆的公共面积
- 三种算法求最大子段和问题——Java实现
- 配置 SQL Server 2005 远程连接(服务器端)
- CodeForces 166E Tetrahedron
- AbstractQueuedSynchronizer(十一)——应用之CountDownLatch
- 编程题目:格式化名字字符串