Fibsieve`s Fantabulous Birthday 找规律
来源:互联网 发布:炉石淘宝买友谊赛值吗 编辑:程序博客网 时间:2024/06/05 17:07
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
3
8
20
25
Sample Output
Case 1: 2 3
Case 2: 5 4
Case 3: 1 5
直接模拟
#include <cstdio>#include <math.h>#define ll long longint main(){ int T; scanf("%d",&T); int kase = 1; while (T--){ ll s; scanf("%lld",&s); ll te = sqrt(s); if (te*te == s) te-=1; ll t = ((te*te+1)+(te+1)*(te+1))/2; ll x,y; if (s == t){ x = y = te+1; } else if (s > t){ if (te&1){ x = (te+1)*(te+1)-t+1; y = (te+1)*(te+1)-s+1; } else { y = (te+1)*(te+1)-t+1; x = (te+1)*(te+1)-s+1; } } else if (s < t){ if (te&1){ y = (te+1)*(te+1)-t+1; x = s-te*te; }else { x = (te+1)*(te+1)-t+1; y = s-te*te; } } printf("Case %d: %lld %lld\n",kase++,x,y); } return 0;}
- Fibsieve`s Fantabulous Birthday 找规律
- Fibsieve`s Fantabulous Birthday<规律>
- lightoj 1008 - Fibsieve`s Fantabulous Birthday 【数学 找规律】
- light OJ1008 - Fibsieve`s Fantabulous Birthday 【找规律】
- Lightoj1008——Fibsieve`s Fantabulous Birthday(找规律)
- Light OJ - 1008 - Fibsieve`s Fantabulous Birthday (数学找规律)
- lightoj-1008 - Fibsieve`s Fantabulous Birthday【思维】【找规律】
- LightOJ1008---Fibsieve`s Fantabulous Birthday (规律)
- LightOJ 1008 - Fibsieve`s Fantabulous Birthday (规律)
- LIGHTOJ-10081008 - Fibsieve`s Fantabulous Birthday(规律)
- LightOJ-1008-Fibsieve`s Fantabulous Birthday [规律]
- Fibsieve`s Fantabulous Birthday
- Fibsieve`s Fantabulous Birthday
- Fibsieve`s Fantabulous Birthday
- Light OJ - 1008 - Fibsieve`s Fantabulous Birthday(数学,找规律)
- Light oj:1008 - Fibsieve`s Fantabulous Birthday【规律】
- Light OJ 1008 Fibsieve`s Fantabulous Birthday【规律】
- Light OJ:1008 Fibsieve's Fantabulous Birthday(规律)
- LeetCode 118. Pascal's Triangle
- 在Idea中连接数据库并生成实体类 -- hibernate
- HDU2196树形dp
- 初学者flex布局的个人尝试
- 《自控力》——第二章(上)
- Fibsieve`s Fantabulous Birthday 找规律
- android studio NDK demo详解
- 设备事件(如旋转设备触发的一些事件)
- Python将一个CSV文件里的数据追加到另一个CSV文件
- 缓存IO和非缓冲IO
- 第三章:阅读的第一个层次:阅读的基础——《如何阅读一本书》
- Mr.Smile填坑记——ButterKnife8.4.0的依赖
- 解决python3输出中文的问题
- VS2015 调试 UGUI (Unity5.5)