H--(LightOJ -- 1008
来源:互联网 发布:linux shell执行exe 编辑:程序博客网 时间:2024/06/09 14:49
Description
Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.
Among these gifts there was an N x N glass chessboard that had a light in each of its cells. When the board was turned on a distinct cell would light up every second, and then go dark.
The cells would light up in the sequence shown in the diagram. Each cell is marked with the second in which it would light up.
(The numbers in the grids stand for the time when the corresponding cell lights up)
In the first second the light at cell (1, 1) would be on. And in the 5th second the cell (3, 1) would be on. Now, Fibsieve is trying to predict which cell will light up at a certain time (given in seconds). Assume that N is large enough.
InputInput starts with an integer T (≤ 200), denoting the number of test cases.
Each case will contain an integer S (1 ≤ S ≤ 1015) which stands for the time.
OutputFor each case you have to print the case number and two numbers (x, y), the column and the row number.
题意:t组数据,每组输入一个n,如题目中的图所示,按题目要求输出n所在的列与行。
Sample Input
3
8
20
25
Sample OutputCase 1: 2 3
Case 2: 5 4
Case 3: 1 5
#include <cstdio>#include <cmath>using namespace std;int main(){ int t; long long int n,a; //因为n的最大值10^15,所以n为long long 整型 scanf("%d",&t); for(int k=1; k<=t; k++) { scanf("%lld",&n); a=(long long int)(sqrt(n)+0.999999); //根据开方求出n所在哪一个方格中 printf("Case %d:",k); if(a%2==0) //奇数方格与偶数方格排数的顺序不同,要分情况输出 { if(2*n<(a*a+(a-1)*(a-1)+1)) printf(" %lld %lld\n",n-(a-1)*(a-1),a); else if(2*n==(a*a+(a-1)*(a-1)+1)) printf(" %lld %lld\n",a,a); else printf(" %lld %lld\n",a,a*a+1-n); } else { if(2*n<(a*a+(a-1)*(a-1)+1)) printf(" %lld %lld\n",a,n-(a-1)*(a-1)); else if(2*n==(a*a+(a-1)*(a-1)+1)) printf(" %lld %lld\n",a,a); else printf(" %lld %lld\n",a*a+1-n,a); } } return 0;}
- H--(LightOJ -- 1008
- lightoj 1008
- lightoj 1008
- LightOJ 1008
- Lightoj 1008
- LightOJ 1008
- LightOJ 1008 (规律)
- Lightoj 1008【规律】
- Lightoj 1008 生日宴会
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- 关于PHP fopen函数在windows系统上创建中文命名的文档时乱码的问题
- MFC自制菜单(既绘制菜单的外观)
- Leetcode Best Time to Buy and Sell Stock II OJ 刷题 算法
- Linux学习笔记----rpm包and rpm命令管理
- 简单密码破译
- H--(LightOJ -- 1008
- 安卓学习笔记(一)自定义控件1
- C++ Primer : 第九章 : vector变长、string的其他操作以及容器适配器
- 10.1-5 双端队列deque
- Zookeeper监控的作用
- ActiveMQ(2) 安装
- 带哨兵的双向链表
- FZU 2087 统计树边
- 如何使用ubuntu14.04中的分区工具