Cody

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

Solution 1931426

Submitted on 12 Sep 2019 by ...
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))

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []

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

ans = []