codility: Euclidean algorithm ( ChocolatesByNumbers, CommonPrimeDivisors)
摘要:
Chocolates By NumbersTwo positive integers N and M are given. Integer N represents the number of chocolates arranged in a circle, numbered from 0 to N... 阅读全文
posted @ 2014-04-07 10:10 parapax 阅读(1518) 评论(0) 推荐(0) 编辑