LIGHTOJ-10081008 - Fibsieve`s Fantabulous Birthday(规律)
来源:互联网 发布:java post json 编辑:程序博客网 时间:2024/06/05 18:54
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.
Input
Input 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.
Output
For each case you have to print the case number and two numbers (x, y), the column and the row number.
Sample Input
Output for Sample Input
3
8
20
25
Case 1: 2 3
Case 2: 5 4
Case 3: 1 5
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int main(){long long a,b,i,j,n,l,r,mid,x,y,cot=1,t;scanf("%lld",&n);while(n--){int flag=0;scanf("%lld",&a);t=sqrt(a);if(t*t==a){if(t%2){x=1;y=t;}else{y=1;x=t;}printf("Case %lld: %lld %lld\n",cot++,x,y);continue;}if(t%2==0){j=a-t*t;if(j<(t+1)){x=t+1;y=j;}else{x=t+1-j%(t+1);y=t+1;}}else{j=a-t*t;if(j<t+1){y=t+1;x=j;}else{y=t+1-j%(t+1);x=t+1;}}printf("Case %lld: %lld %lld\n",cot++,x,y);}return 0; }
- LIGHTOJ-10081008 - Fibsieve`s Fantabulous Birthday(规律)
- LightOJ 1008 - Fibsieve`s Fantabulous Birthday (规律)
- LightOJ-1008-Fibsieve`s Fantabulous Birthday [规律]
- Fibsieve`s Fantabulous Birthday<规律>
- lightoj 1008 - Fibsieve`s Fantabulous Birthday 【数学 找规律】
- 【LightOJ】1008 - Fibsieve`s Fantabulous Birthday(规律)
- lightoj-1008 - Fibsieve`s Fantabulous Birthday【思维】【找规律】
- lightoj 1008 - Fibsieve`s Fantabulous Birthday
- LightOJ 1008 - Fibsieve`s Fantabulous Birthday
- lightOJ 1008 - Fibsieve`s Fantabulous Birthday
- 【思维】LightOj Fibsieve`s Fantabulous Birthday 1008
- LightOJ-1008 Fibsieve`s Fantabulous Birthday
- 1008 - Fibsieve`s Fantabulous Birthday (lightoj)
- lightoj 1008 - Fibsieve`s Fantabulous Birthday 乱搞
- LightOJ 1008 Fibsieve`s Fantabulous Birthday
- Lightoj 1008 - Fibsieve`s Fantabulous Birthday
- LightOJ 1008 Fibsieve`s Fantabulous Birthday
- 【LightOJ 1008 Fibsieve`s Fantabulous Birthday】
- 关于java枚举
- 整合大量开源库温习基础项目(三)登陆注册主页面大致完成,分析下怎么处理用户信息
- linux常用命令语法
- Spring MVC 3.0.5+Spring 3.0.5+MyBatis3.0.4全注解实例详解(四)
- Toast.makeText().show();
- LIGHTOJ-10081008 - Fibsieve`s Fantabulous Birthday(规律)
- Spring MVC 3.0.5+Spring 3.0.5+MyBatis3.0.4全注解实例详解(五)
- android(5)(模拟QQ登录,文件存储,SD卡存储,SharedPreferences存储)
- mysql命令大全
- 用jQuery 写前端 关于不执行的问题
- 数据结构--Chapter5(树与二叉树)
- js闭包
- MySQL 数据库性能优化之缓存参数优化
- txt阅读器