## 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.

### Input Format

The input will be two positive integers t1 and t2 (0 < t2 < t1 < 10000).

### Output Format

The output will be the length of the sumac sequence given by the starting numbers t1 and t2.

```120
71```

### Sample Output

`5`

Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (0/0)
so difficult!who can help me???

• (0/0)
why you think it's difficult when you already finished it??????????????????????

• (0/0)
Should the runtime be changed to 2 seconds and memory 16M?

• (0/0)
I went through and lowered a bunch of time and memory constraints, but I left a lot untouched. These constraints don't really matter if they're higher than necessary, though.