← 返回题目
题库练习 Pairs of Numbers
← 上一题 下一题 →

A8299 | Pairs of Numbers

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

重题请做P2090

输入格式

Let's assume that we have a pair of numbers ( $a,b$ ). We can get a new pair ( $a+b,b$ ) or ( $a,a+b$ ) from the given pair in a single step.

Let the initial pair of numbers be (1,1). Your task is to find number $k$ , that is, the least number of steps needed to transform (1,1) into the pair where at least one number equals $n$ .

输出格式

The input contains the only integer $n$ ( $1<=n<=10^{6}$ ).

输入输出样例

输入 #1
5
输出 #1
3
输入 #2
1
输出 #2
0
C++ 编辑器
输入
输出