周赛4
philophobia
这个作者很懒,什么都没留下…
展开
-
周赛4-Levko and Permutation
Levko loves permutations very much. A permutation of length n is a sequence of distinct positive integers, each is at most n.Let’s assume that value gcd(a, b) shows the greatest common divisor of numbe原创 2017-08-22 16:22:37 · 257 阅读 · 0 评论 -
C - Almost Prime
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which原创 2017-08-22 16:57:53 · 440 阅读 · 0 评论