Check whether a number can be represented by sum of two squares using Fermat Theorem .
#include <bits/stdc++.h> NEW_LINE using namespace std ; bool judgeSquareSum ( int n ) { for ( int i = 2 ; i * i <= n ; i ++ ) { int count = 0 ; if ( n % i == 0 ) {