2011 Canadian Computing Competition, Stage 1
Problem J3: Sumac Sequences
In a sumac sequence, t1, t2, …, tm, each term is an integer greater than or equal to 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.
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 integers t1 and t2 (0 < t2 < t1 < 10000).
The output will be the length of the sumac sequence given by the starting numbers t1 and t2.
Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Added: Mar 01, 2011
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3