UVA - 11774 Doom's Day (规律)
来源:互联网 发布:笔记本电脑测评软件 编辑:程序博客网 时间:2024/04/30 07:59
We all know about the legend oftower of Hanoi. It is said that the world will end after finishing the puzzle.What we don't know is another legend about when the world will end which is verifiedby the scientists.
It is all about a 3^n * 3^m grid.Initially the grid is filled with 1 to 3^(m+n) in row major order. At each stepthe puzzle is rearranged by reading it in row major order and putting them incollumn major order. See the following examples.
1
2
3
to
1
10
19
4
5
6
2
11
20
7
8
9
3
12
21
10
11
12
4
13
22
13
14
15
5
14
23
16
17
18
6
15
24
19
20
21
7
16
25
22
23
24
8
17
26
25
26
27
9
18
27
1
2
3
to
1
4
7
4
5
6
2
5
8
7
8
9
3
6
9
Now every day the puzzle is rearrangedonce. The legend says if someday initial configuration returns the world willend. Now you are wondering when the world is going to end.
Input
Input starts with a linecontaining number of test cases T ≤ 10000. Each test case containstwo positive integerm ≤ 10^9and n≤ 10^9.
Output
For each case print one linecontaining days before dooms day. The input will be such that this number fitsin 64 bit unsigned integer.
SampleInput Outputfor Sample Input
5
1 1
1 2
3 1
2 2
98876767 12234
Case 1: 2
Case 2: 3
Case 3: 4
Case 4: 2
Case 5: 98889001
Problemsetter:Tanaeem Md. Moosa
SpecialThanks to: Jane Alam Jan
题意:往3^n * 3^m的格子里1到3^(n+m) 的数,每次的操作是:将数按行优先拿出来,再按列优先放进去,求多少次后回到初始状态
思路:规律ans=(a+b)/gcd(a, b);
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}int main() {int t, a, b, cas = 1;scanf("%d", &t);while (t--) {scanf("%d%d", &a, &b);printf("Case %d: %d\n", cas++, (a+b)/gcd(a, b));}return 0;}
- UVA - 11774 Doom's Day (规律)
- UVA 11774 - Doom's Day(规律)
- uva 11774 - Doom's Day(规律)
- UVa 12019 - Doom's Day Algorithm
- hdu 4706 Children's Day(找规律)
- UVA 1420 Priest John's Busiest Day(贪心)
- uva 10881 Piotr's Ants 规律
- UVA - 1420 Priest John's Busiest Day
- UVA - 11308(规律)
- HDU 5239 Doom 线段树+找规律
- ZOJ 3785 What day is that day? (找规律)
- J-What day is that day?(打表找规律)
- UVa 1420 Priest John's Busiest Day 解题报告(贪心)
- uva 10359 - Tiling(规律)
- UVA Number Sequence(规律)
- Children's Day(4706)
- (二)S - S Lightoj 1008 【规律】
- uva 1420 - Priest John's Busiest Day(贪心)
- adc 采样 校准
- 不错的安全书籍
- Camel路由构建过程
- Android EditText中添图片(Spanned)后的定位问题
- Android高薪面试题集
- UVA - 11774 Doom's Day (规律)
- 用MySQL创建数据库和数据库表
- Security
- git(含github)教程[0基础]
- 5.struts.xml配置常量和Action处理流程
- hud Fibonacci
- mysql 模糊查询
- topcoder srm 623解题报告
- 4.Struts2 result视图转发类型