Company: Maq_27oct
Difficulty: medium
Twinkle's Pythagorean Prime Problem Description Twinkle is weak in Mathematics, so she joined Mathematics coaching. After studying there for a month she had a test where she had to write Pythagorean primes . Pythagorean primes are numbers which are primes and are of the form 4n + 1. You need to check whether the number written by Twinkle is a Pythagorean prime or not. Input First line : T number of test cases Next T test cases follow containing a single integer per test case N . Output Check whether N is Pythagorean prime or not, if yes output YES else NO . Constraints 1 0 Examples Example 1: Input: 2 5 8 Output: YES NO Explanation: In the first test case, 5 is a prime as well as of the form (4n+1) so print "YES" In the second test case 8 is not a prime number hence print "NO" Starter Code #include <bits/stdc++.h> using namespace std; string checkPythagoreanPrime (int n) { // Write your code here } int main() { ios::sync_with_stdio(0); cin.tie(0); int T; cin >> T; for (int t_i =