Discussion @ 1132. Square Root @ Timus Online Judge

Зане We can use O(n*prime(n)) to AC this problem.It's the most easy algorithms. [1] // Problem 1132. Square Root 3 Dec 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个解

ura Re: We can use O(n*prime(n)) to AC this problem.It's the most easy algorithms. // Problem 1132. Square Root 17 Nov 2019 23:08

There are 3512 primes under 32767.

Discussion of Problem 1132. Square Root