http://codeforces.com/problemset/problem/712/C
来源:互联网 发布:两个矩阵的协方差公式 编辑:程序博客网 时间:2024/06/04 19:33
Memory is now interested in the de-evolution of objects, specifically triangles. He starts with an equilateral triangle of side length x, and he wishes to perform operations to obtain an equilateral triangle of side length y.
In a single second, he can modify the length of a single side of the current triangle such that it remains a non-degenerate triangle (triangle of positive area). At any moment of time, the length of each side should be integer.
What is the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y?
The first and only line contains two integers x and y (3 ≤ y < x ≤ 100 000) — the starting and ending equilateral triangle side lengths respectively.
Print a single integer — the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y if he starts with the equilateral triangle of side length x.
6 3
4
8 5
3
22 4
6
In the first sample test, Memory starts with an equilateral triangle of side length 6 and wants one of side length 3. Denote a triangle with sides a, b, and c as (a, b, c). Then, Memory can do .
In the second sample test, Memory can do .
In the third sample test, Memory can do:
.
题目大意:给你一个x和y,让你把边长为x的等边三角形通过最短的步数变为长度为y 的等边三角形
我的方法是逆过来构造的,详细的看代码,我也不好解释,这题感觉比较水的说
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<string>#include<vector>#include<stack>#include<set>#include<map>#include<queue>#include<algorithm>using namespace std;int main(){ int x,y; int a[4]; int i,j; int coun; int tmp; while(~scanf("%d %d",&x,&y)){ for(i=0;i<3;i++){ a[i]=y; } coun=0; while(a[2]<x){ a[2]=a[0]+a[1]-1; tmp=a[2]; a[2]=a[0]; a[0]=a[1]; a[1]=tmp; coun++; /*for(i=0;i<3;i++){ printf("%d ",a[i]); } printf("\n");*/ } printf("%d\n",coun); } return 0;}
- http://codeforces.com/problemset/problem/712/C
- http://codeforces.com/problemset/problem/4/C
- http://codeforces.com/problemset/problem/237/C Primes on Interval
- http://codeforces.com/problemset/problem/714/C Sonya and Queries
- http://codeforces.com/problemset/problem/4/A
- http://codeforces.com/problemset/problem/4/B
- http://codeforces.com/problemset/problem/1/A
- http://codeforces.com/problemset/problem/228/A
- http://codeforces.com/problemset/problem/266/B
- http://codeforces.com/problemset/problem/236/A
- http://codeforces.com/problemset/problem/716/C Plus and Square Root
- Т-prime http://codeforces.com/problemset/problem/230/B
- dfs搜索练习题 http://codeforces.com/problemset/problem/589/J
- http://codeforces.com/problemset/problem/4/D Mysterious Present (簡單LIS)
- 欧拉路的判定 http://hihocoder.com/problemset/problem/1176
- http://codeforces.com/contest/276/problem/C
- http://codeforces.com/contest/366/problem/C之01背包
- http://212.193.33.23/problemset/problem/154/A
- POJ 2481 Cows
- java加锁与同步方法
- 2017.4.10 学习记录与感想 (xss、ctf、学习感想)
- MySQL(五)--数据类型
- 还是01串
- http://codeforces.com/problemset/problem/712/C
- 选择排序
- hdu1285 确定比赛名次(拓扑排序)
- 旋转数组的最小数字
- PAT_A 1036. Boys vs Girls (25)
- Java虚拟机(HotSpot)对象
- 良心推荐十款堪称神器的软件
- Accelerated C++<4-4>
- Vue.js之devtools