1008 - Fibsieve`s Fantabulous Birthday (lightoj)
来源:互联网 发布:java 斐波纳契 第n 编辑:程序博客网 时间:2024/05/29 08:36
http://www.lightoj.com/volume_showproblem.php?problem=1008
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 thatN 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 <algorithm>#include <stack>#include <cmath>#define SI(T)int T;scanf("%d",&T)#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define LL long longusing namespace std;const int SIZE=5e4+10;const int maxn=1<<30;int main(){ SI(T); for(int cas=1;cas<=T;cas++){ LL s; scanf("%lld",&s); LL n=(LL)sqrt(s*1.); if(n*n==s){ if(n&1)printf("Case %d: %d %lld\n",cas,1,n); else printf("Case %d: %lld %d\n",cas,n,1); continue; } if(n&1){ if(n*n+n+1>=s)printf("Case %d: %lld %lld\n",cas,s-n*n,n+1); else printf("Case %d: %lld %lld\n",cas,n+1,(n+1)*(n+1)-s+1); } else { if(n*n+n+1>=s)printf("Case %d: %lld %lld\n",cas,1+n,s-n*n); else printf("Case %d: %lld %lld\n",cas,(n+1)*(n+1)-s+1,n+1); } }}
- 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 Fibsieve`s Fantabulous Birthday 1008
- 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 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【思维】【找规律】
- 开始的开始。。
- 网页排序 HITS算法的python实现
- 关于jQuery
- RPM是RedHat Package Manager(RedHat软件包管理工具)类似Windows里面的“添加/删除程序”
- Java实现OUT参数
- 1008 - Fibsieve`s Fantabulous Birthday (lightoj)
- 一、web基础
- GCD
- hadoop 安装配置 Ubuntu 14.04server
- 为pycharm修改Theme & Color
- swift 学习笔记
- 二、Tomcat
- 生成验证码
- 关于Adapter和ViewHolder的另类写法