2014-2015 ACM-ICPC, NEERC, Moscow Subregional Contest D. Do it Right!

D. Do it Right!

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Given two distinct positive integers A and B, find out if it is possible to find a third positive integer C so that a triangle with the sides A, Band C is a right triangle. Remember that a triangle is called a right triangle if one of its angles equals to 90 degrees.

Input

The first line of input contains two positive integers A and B: the lengths of the two given sides (1 ≤ A < B ≤ 100).

Output

Output "YES" if it is possible to find such an integer C, or "NO" otherwise.

Sample test(s)

input

3 4

output

YES

input

1 2

output

NO

Note

• In the first example, we can take C = 5.
• In the second example, it is impossible to find an integer C with the required property.

题意：给a，b，找一个c是的a^2+b^2=c^2

分析：a，b如此小，为何不暴力？

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <iostream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <vector>
 #include <deque>
 #include <queue>
 using namespace std;
 typedef long long LL;
 typedef double DB;
 #define Rep(i, n) for(int i = (0); i < (n); i++)
 #define Repn(i, n) for(int i = (n)-1; i >= 0; i--)
 #define For(i, s, t) for(int i = (s); i <= (t); i++)
 #define Ford(i, t, s) for(int i = (t); i >= (s); i--)
 #define rep(i, s, t) for(int i = (s); i < (t); i++)
 #define repn(i, s, t) for(int i = (s)-1; i >= (t); i--)
 #define MIT (2147483647)
 #define MLL (1000000000000000000LL)
 #define INF (1000000001)
 #define mk make_pair
 #define ft first
 #define sd second
 #define clr(x, y) (memset(x, y, sizeof(x)))
 #define sqr(x) ((x)*(x))
 #define sz(x) ((int) (x).size())
 #define puf push_front
 #define pub push_back
 #define pof pop_front
 #define pob pop_back

 template<class T>
 inline T Getint()
 {
     char Ch = ' ';
     T Ret = ;
     while(!(Ch >= '' && Ch <= '')) Ch = getchar();
     while(Ch >= '' && Ch <= '')
     {
         Ret = Ret *  + Ch - '';
         Ch = getchar();
     }
     return Ret;
 }

 int a, b;

 inline void Input()
 {
     cin >> a >> b;
 }

 inline int Sqr(int x)
 {
     return x * x;
 }

 inline void Solve()
 {
     For(i, , )
     {
         int Arr[];
         Arr[] = a * a;
         Arr[] = b * b;
         Arr[] = i * i;
         sort(Arr, Arr + );
         if(Arr[] + Arr[] == Arr[])
         {
             puts("YES");
             return;
         }
     }
     puts("NO");
 }

 int main() {
      Input();
      Solve();
     return ;
 }