Light oj 1008 Fibsieve`s Fantabulous Birthday
来源:互联网 发布:c4dr18注册机mac 编辑:程序博客网 时间:2024/04/29 05:03
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.
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<stdio.h>#include<math.h>#include<string.h>#include<algorithm>using namespace std;int main(){long long t,s,n,x,y;scanf("%lld",&t);int k=1;while(t--){scanf("%lld",&s);n=sqrt(s);printf("Case %d: ",k++);if(n*n==s){if(n%2==0){printf("%lld 1\n",n);continue;}else{printf("1 %lld\n",n);continue;}}n++; if(n*n-s<n) { x=n; y=n*n-s+1;}else{x=-n*n+2*n+s-1;y=n; } if(n%2!=0) swap(x,y); printf("%lld %lld\n",x,y);}}
- 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
- 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【规律】
- 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 (数学找规律)
- light oj 1008 - Fibsieve`s Fantabulous Birthday(规律推导)
- light oj 1008 Fibsieve`s Fantabulous Birthday (规律)
- 【Light】[1008]Fibsieve`s Fantabulous Birthday
- Light OJ 1008 Fibsieve`s Fantabulous Birthday(找出数字位置)
- Light OJ - 1008 - Fibsieve`s Fantabulous Birthday(数学,找规律)
- Fibsieve`s Fantabulous Birthday
- C语言的函数(第一篇章:函数的概述、定义、类型与返回值)
- 安卓小案例收集四(多媒体)
- 伸展树的节点的size域的应用
- Leetcode刷题系列(一)Subsets 与 Permutation
- Android事件传递机制
- Light oj 1008 Fibsieve`s Fantabulous Birthday
- JavaScript框架思想 选择器封装最终
- oracle数据库修改、创建配置文件
- angular路由移除#号(跟nginx)
- python绘制封闭多边形
- 关于信息提示框的问题
- HDU-1092
- 三种初级排序算法(冒泡、选择、直接插入)java实现及其性能比较
- Matlab 提取二值图像中心线 (Matlab extract centreline of binary image)