###### codeforces 407C Triangle

Description
There is a right triangle with legs of length a and b. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the appropriate coordinates of vertices.

Input
The first line contains two integers a, b (1 ≤ a, b ≤ 1000), separated by a single space.

Output
In the first line print either “YES” or “NO” (without the quotes) depending on whether the required location exists. If it does, print in the next three lines three pairs of integers — the coordinates of the triangle vertices, one pair per line. The coordinates must be integers, not exceeding 109 in their absolute value.

Sample Input
Input
1 1
Output
NO
Input
5 5
Output
YES
2 1
5 5
-2 4
Input
5 10
Output
YES
-10 4
-2 -2
1 2

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a,b,h1[10],l1[10],h2[10],l2[10],flag1=0,flag2=0;
cin>>a>>b;
for(int i=1; i<1000; i++)
{
for(int j=i; j<1000; j++)
{
if(i*i+j*j==a*a)
{
h1[flag1]=i;
l1[flag1]=j;
flag1++;
}
if(i*i+j*j==b*b)
{
h2[flag2]=i;
l2[flag2]=j;
flag2++;
}
}
}
int t=0;
if(flag1==0||flag2==0)
cout<<"NO"<<endl;
else
{
for(int i=0; i<flag1; i++)
{
for(int j=0; j<flag2; j++)
{
if(1.0*h1[i]/h2[j]==1.0*l1[i]/l2[j])
{
if(h1[i]!=l2[j])
{
cout<<"YES"<<endl;
cout<<0<<" "<<0<<endl;
cout<<l1[i]<<" "<<h1[i]<<endl;
cout<<0-h2[j]<<" "<<l2[j]<<endl;
t=1;
break;
}
else if(h2[j]!=l1[i])
{
cout<<"YES"<<endl;
cout<<0<<" "<<0<<endl;
cout<<l2[j]<<" "<<h2[j]<<endl;
cout<<0-h1[i]<<" "<<l1[i]<<endl;
t=1;
break;
}
}
}
if(t==1)
break;
}
if(t==0)
cout<<"NO"<<endl;
}
return 0;
}

#### Codeforces 939A Love Triangle（三角恋问题）

2018-02-19 23:59:49

#### Codeforces Round #239 (Div. 2) C. Triangle（简单数学+暴力）

2014-03-30 17:15:50

#### Codeforces 407 A. Triangle 【Codeforces Round #239 (Div. 1)】

2015-11-20 20:50:37

#### CodeForces - 766B Mahmoud and a Triangle

2017-02-14 21:05:25

#### CodeForces 18A Triangle

2016-04-04 18:13:25

#### CodeForces 407C

2014-04-23 09:44:09

#### [Codeforces 258B & 259 D]Little Elephant and Elections 数位dp+dfs

2014-07-09 08:43:27

#### Codeforces Round #464 (Div. 2) D. Love Rescue 并查集

2018-02-19 23:01:21

#### CodeForces 185A. Plant（矩阵快速幂）

2015-04-08 18:37:25

#### codeforces 407C Curious Array 数学

2017-03-20 19:03:50

## 不良信息举报

codeforces 407C Triangle