Light OJ 1008- Fibsieve`s Fantabulous Birthday
来源:互联网 发布:沙河淘宝卖家跑路 编辑:程序博客网 时间:2024/04/29 07:09
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<stdio.h>#include<cmath>using namespace std;int main(){ int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++) { long long n,x,r,c;scanf("%lld",&n);printf("Case %d: ",ca);x=sqrt(n); if(x*x<n) { if(x%2==0) { if(x*x+1+x==n) { r=x+1; c=x+1;}else if(x*x+1+x>n){ r=x+1; c=x+1-((x*x+1+x)-n);}else{ r=x+1-(n-(x*x+1+x)); c=x+1;} } else { if(x*x+1+x==n) { r=x+1; c=x+1;}else if(x*x+1+x>n){ r=x+1-(x*x+1+x-n); c=x+1;}else{ r=x+1; c=x+1-(n-(x*x+1+x));} }}if(x*x==n){ if(x%2==0) { r=x; c=1; } else { r=1; c=x; }}printf("%lld %lld\n",r,c); } return 0;}
- 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
- First Missing Positive
- Source Insight 常用设置和快捷键大全
- 怎么查看电脑开机记录
- 没理打死了看到了
- 史可法何首乌
- Light OJ 1008- Fibsieve`s Fantabulous Birthday
- 什么东东,博客又被封了,唉,只能重开一个玩了吧,不好意思了
- 夜难寐
- 浅析epoll-为何多路复用I/O要使用epoll
- 作为一个新人,怎样学习嵌入式Linux
- 程序员技术练级攻略
- Ruby如何实现动态方法调用?
- wqe4ewq
- 浅析epoll – epoll函数深入讲解