Problems
Contests
Events
Topic
IDE
PacketHub
Login
Description
Editorial
My Submission
1043.Pairs of Numbers
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1043.Pairs of Numbers
Time Limit:1000MS Memory Limit:65535KB
Description
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.
Input
The input contains the only integer n (1 ≤ n ≤ 10^6^).Process to the end of file.
Output
Print the only integer k.
Sample test
Sample input
5 1
Sample output
3 0
Note
Tags
brute force
number theory
math
dfs
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
5 1
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题,选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数,设置为0则不限制。
0
80
100
120