[BOJ 6780] Sumac Sequences
View as PDF
Submit solution
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text
Points:
1
Time limit:
2.0s
Memory limit:
512M
Problem types
Allowed languages
In a sumac sequence, t1, t2, .., tm, each term is an integer greater than or equal 0. Also, each term, starting with the third, is the difference of the preceding two terms (that is, tn+2 = tn − tn+1 for n ≥ 1). The sequence terminates at tm if tm−1 < tm.</p>
For example, if we have 120 and 71, then the sumac sequence generated is as follows:
120, 71, 49, 22, 27.
This is a sumac sequence of length 5.
입력 형식
The input will be two positive numbers t1 and t2, with 0 < t2 < t1 < 10000.
출력 형식
The output will be the length of the sumac sequence given by the starting numbers t1 and t2.
예제 입력
120
71
예제 출력
5
Comments