The first line of input contains a single integer t <= 10000: the number of test cases. T, each of which consists of one integer 0 <= n <= 10^8.
t <= 10000
0 <= n <= 10^8
For each test case, it is displayed Yesif it is possible to represent the given number as the sum of two squares and Noif this is not possible.
Yes
No
Hint . The number N is expressed as the sum of two squares iff in a simple factorization of N, each prime number (4k + 3) occurs even the number of times!
Source: https://habr.com/ru/post/1793343/More articles:Launcher returns EADDRINUSE for binding a second time - cPHP Fat Free Closing Set - closuresразница между "адресом в использовании" с bind() в Windows и Linux - errno = 98 - linuxPriority Question + Repeat Modifier - operator-precedenceYou can add an extra column to SimpleCursorAdapter - androidHow to protect the password of my SQL Server database? - sql-serverFactorial Function - Design and Testing - c #What is in your .muttrc? - muttКак передать параметры в службе Windows из программы Installer to Main в Program.cs? - c#How to change data binding from left to right in Asp.net table? - c #All Articles