|
|
вернуться в форумWe can use O(n*prime(n)) to AC this problem.It's the most easy algorithms. Послано Зане 3 дек 2009 11:10 We can qsort(n) and enumeration to solve it.
Notice that n is a prime.There are 2500 primes under 32767.
Enumeration can solve this problem.
And every ask have mostly 2 answers.最多2个解 Re: We can use O(n*prime(n)) to AC this problem.It's the most easy algorithms. Послано ura 17 ноя 2019 23:08 There are 3512 primes under 32767. |
|
|
