Problem statement
Stone division
C# submission - need to continue to work on the solution
1. score 0, only pass the sample test case
2. second submission with more problems
Julia's idea to solve the problem:
She stopped on her third algorithm, worked so hard, over 5 hours, messing with recursive/ bugs with concatenating the string - her favorite test case: 2 3 4 6 8, n = 12
She tried so hard to work out on this test case:
2 3 4 6 8 12
2 T F T T T T - can divided by 2?
3
4
6
8
She worked on the backward to find all possible routes - for example, 12, 6, 3, or 12, 6, 2 etc.
It is hard to review the performance. Because Julia worked damn hard on this algorithm, she tried to push so hard and then she almost fell to sleep, she knew that she should cut the route she took; There is a lot of extra work she carelessly brought into the above submission.
Will continue later.
No comments:
Post a Comment