Cody

# Problem 273. Recurring Cycle Length (Inspired by Project Euler Problem 26)

Solution 2627974

Submitted on 29 Jun 2020 by Jens Kjærgaard Boldsen
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 1; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 1 L = 0

2   Pass
x = 2; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 2 dTst = 1 L = 0

3   Pass
x = 3; y_correct = 1; assert(isequal(recurring_cycle(x),y_correct))

dTst = 3 L = 1

4   Pass
x = 4; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 4 dTst = 2 dTst = 1 L = 0

5   Pass
x = 5; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 5 dTst = 1 L = 0

6   Pass
x = 6; y_correct = 1; assert(isequal(recurring_cycle(x),y_correct))

dTst = 6 dTst = 3 L = 1

7   Pass
x = 7; y_correct = 6; assert(isequal(recurring_cycle(x),y_correct))

dTst = 7 L = 6

8   Pass
x = 8; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 8 dTst = 4 dTst = 2 dTst = 1 L = 0

9   Pass
x = 9; y_correct = 1; assert(isequal(recurring_cycle(x),y_correct))

dTst = 9 L = 1

10   Pass
x = 10; y_correct = 0; assert(isequal(recurring_cycle(x),y_correct))

dTst = 10 dTst = 5 dTst = 1 L = 0

11   Pass
x = 17; y_correct = 16; assert(isequal(recurring_cycle(x),y_correct))

dTst = 17 L = 16

12   Pass
x = 19; y_correct = 18; assert(isequal(recurring_cycle(x),y_correct))

dTst = 19 L = 18

13   Pass
x = 197; y_correct = 98; assert(isequal(recurring_cycle(x),y_correct))

dTst = 197 L = 98

14   Pass
x = 1977; y_correct = 658; assert(isequal(recurring_cycle(x),y_correct))

dTst = 1977 L = 658

15   Pass
x = 12345; y_correct = 822; assert(isequal(recurring_cycle(x),y_correct))

dTst = 12345 dTst = 2469 L = 822