buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <stdio.h>
int main() {
int a, b, c, f = 0, N, i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d %d", &a, &b, &c);
if (a * a == c * c + b * b) {
f = 1;
}
if (b * b == c * c + a * a) {
f = 1;
}
if (c * c == a * a + b * b) {
f = 1;
}
if (f == 1) {
... | #include <stdio.h>
int main() {
int a, b, c, f, N, i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
f = 0;
scanf("%d %d %d", &a, &b, &c);
if (a * a == c * c + b * b) {
f = 1;
}
if (b * b == c * c + a * a) {
f = 1;
}
if (c * c == a * a + b * b) {
f = 1;
}
if (f =... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 154 | 6 |
#include <math.h>
#include <stdio.h>
int main() {
long long n, a, b, c, i = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%lld %lld %lld", &a, &b, &c);
if (pow(a, 2) + pow(b, 2) == pow(c, 2)) {
printf("yes\n");
} else if ((pow(a, 2) + pow(c, 2)) == pow(b, 2)) {
printf("yes\n");
... | #include <math.h>
#include <stdio.h>
int main() {
long long n, a, b, c, i = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%lld %lld %lld", &a, &b, &c);
if (pow(a, 2) + pow(b, 2) == pow(c, 2)) {
printf("YES\n");
} else if ((pow(a, 2) + pow(c, 2)) == pow(b, 2)) {
printf("YES\n");
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 186 | 8 |
#include <stdio.h>
int main(void) {
int input[3];
int n, cnt, cnt2, flag, tmp;
scanf("%d", &n);
for (cnt = 0; cnt < n; ++cnt) {
scanf("%d %d %d", &input[0], &input[1], &input[2]);
do {
flag = 0;
for (cnt2 = 0; cnt2 < 1; ++cnt2) {
tmp = 0;
if (input[cnt2] < input[cnt2 + 1]... | #include <stdio.h>
int main(void) {
int input[3];
int n, cnt, cnt2, flag, tmp;
scanf("%d", &n);
for (cnt = 0; cnt < n; ++cnt) {
scanf("%d %d %d", &input[0], &input[1], &input[2]);
do {
flag = 0;
for (cnt2 = 0; cnt2 < 2; ++cnt2) {
tmp = 0;
if (input[cnt2] < input[cnt2 + 1]... | [["-", 0, 82, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 82, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 16, 31, 23, 0, 16, 31, 69, 71, 13], ["+", 0, 16, 31, 23, 0, 16, 31, 69, 71, 13], ["-", 0, 16, 31, 23, 0, 16, 12, 69, 71, 13], ["+", 0, 16, 31, 23, 0, 16, 12, 69, 71, 13], ["-", 0, 16, 12, 23, 0, 16, 31, 69, 71, 13], ["+", 0, 1... | 0 | 221 | 10 |
#include <stdio.h>
int main() {
int i, j, values[3];
scanf("%d\n", &i);
for (j = 0; j < i; j++) {
scanf("%d %d %d", &values[0], &values[1], &values[2]);
sort_aoj_volume0003(values);
if (values[0] * values[1] + values[1] * values[1] ==
values[2] * values[2]) {
printf("YES\n");
} els... |
#include <stdio.h>
int main() {
int i, j, values[3];
scanf("%d\n", &i);
for (j = 0; j < i; j++) {
scanf("%d %d %d", &values[0], &values[1], &values[2]);
sort_aoj_volume0003(values);
if (values[0] * values[0] + values[1] * values[1] ==
values[2] * values[2]) {
printf("YES\n");
} el... | [["-", 0, 16, 31, 16, 31, 16, 12, 69, 71, 13], ["+", 0, 16, 31, 16, 31, 16, 12, 69, 71, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 220 | 4 |
#include <stdio.h>
int main() {
int i, n;
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a, &b, &c);
a *= a;
b *= b;
c *= c;
if (a + b == c || b + c == a || c + a == b)
puts("YES");
else
puts("No");
}
return 0;
} | #include <stdio.h>
int main() {
int i, n;
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a, &b, &c);
a *= a;
b *= b;
c *= c;
if (a + b == c || b + c == a || c + a == b)
puts("YES");
else
puts("NO");
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 111 | 2 |
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b == c * c || b * b + c * c == a * a ||
a * a + c * c == b * b) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b == c * c || b * b + c * c == a * a ||
a * a + c * c == b * b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
} | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 103 | 2 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
template <cla... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
template <cla... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 214 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int ignore;
cin >> ignore;
int fi;
int se;
int th;
vector<int> v;
while (cin >> fi >> se >> th) {
v.push_back(fi);
v.push_back(se);
v.push_back(th);
sort(v.begin(), v.end(), greater<int>());
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int ignore;
cin >> ignore;
int fi;
int se;
int th;
vector<int> v;
while (cin >> fi >> se >> th) {
v.push_back(fi);
v.push_back(se);
v.push_back(th);
sort(v.begin(), v.end(), greater<int>());
... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 146 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
int listen_dataCount();
class triangle {
private:
int longestLine;
int line[2];
public:
triangle();
void is_rightTriangle();
};
triangle::triangle() {
using namespace std;
int inputs[3];
cin >> inputs[0] >> inputs[1] >> inputs[2];
sort(inpu... | #include <algorithm>
#include <iostream>
#include <math.h>
int listen_dataCount();
class triangle {
private:
int longestLine;
int line[2];
public:
triangle();
void is_rightTriangle();
};
triangle::triangle() {
using namespace std;
int inputs[3];
cin >> inputs[0] >> inputs[1] >> inputs[2];
sort(inpu... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 251 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i;
float a, b, c;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (hypot(a, b) == c || hypot(b, c) == a || hypot(a, c) == b)
cout << "YES" << endl;
else
cout << " NO" << endl;
}
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i;
float a, b, c;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (hypot(a, b) == c || hypot(b, c) == a || hypot(a, c) == b)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
} | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 95 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m[3];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m[0] >> m[1] >> m[2];
sort(m, m + 3);
if (pow(m[0], 2) + pow(m[1], 2) == pow(m[2], 2))
cout << "Yes" << endl;
else
cout << "No" << e... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m[3];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m[0] >> m[1] >> m[2];
sort(m, m + 3);
if (pow(m[0], 2) + pow(m[1], 2) == pow(m[2], 2))
cout << "YES" << endl;
else
cout << "NO" << e... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 122 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[j];
}
sort(a, a + 3);
if (a[2] * a[2] == (a[0] * a[0] + a[1] * a[1]))
cout << "Yes" << endl;
else
cout << "No... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[j];
}
sort(a, a + 3);
if (a[2] * a[2] == (a[0] * a[0] + a[1] * a[1]))
cout << "YES" << endl;
else
cout << "NO... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 128 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t[1000][3], cnttri, dataset_num, i;
cin >> dataset_num;
for (cnttri = 0; cnttri < dataset_num; cnttri++) {
cin >> t[cnttri][0] >> t[cnttri][1] >> t[cnttri][2];
sort(t[cnttri], t[cnttri] + 2);
}
for (i = 0; i < cnttri; i++)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t[1000][3], cnttri, dataset_num, i;
cin >> dataset_num;
for (cnttri = 0; cnttri < dataset_num; cnttri++) {
cin >> t[cnttri][0] >> t[cnttri][1] >> t[cnttri][2];
sort(t[cnttri], t[cnttri] + 3);
}
for (i = 0; i < dataset_num;... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 176 | 4 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<bool> result(n);
array<int, 3> triangle;
for (int i = 0; i < n; i++) {
cin >> triangle[0] >> triangle[1] >> triangle[2];
... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<bool> result(n);
array<int, 3> triangle;
for (int i = 0; i < n; i++) {
cin >> triangle[0] >> triangle[1] >> triangle[2];
... | [["-", 0, 2, 3, 4, 0, 2, 63, 346, 141, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 346, 141, 22]] | 1 | 180 | 2 |
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
long N;
long length[3];
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> length[0] >> length[1] >> length[2];
std::sort(length, length + 3);
if (length[0] * length[0] + length[1... | #include <cmath>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
long N;
long length[3];
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> length[0] >> length[1] >> length[2];
std::sort(length, length + 3);
if (length[0] * length[0] + length[1... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 141 | 4 |
#include <math.h>
#include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int i, a[1000], b[1000], c[1000];
for (i = 0; i < N; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < N; i++) {
float A = a[i], B = b[i], C = c[i];
float d = fmax(A, B), sm1 = fmin(A, B);
float biggest... | #include <math.h>
#include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int i, a[1000], b[1000], c[1000];
for (i = 0; i < N; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < N; i++) {
float A = a[i], B = b[i], C = c[i];
float d = fmax(A, B), sm1 = fmin(A, B);
float biggest... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 201 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[3];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if ((a[2] * a[2]) == (a[1] * a[1]) * (a[0] * a[0]))
cout << "YES" << endl;
else
cout <<... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[3];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if ((a[2] * a[2]) == (a[1] * a[1]) + (a[0] * a[0]))
cout << "YES" << endl;
else
cout <<... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 48], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 129 | 2 |
#include <iostream>
int main() {
int a, b, c, i, n;
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> a >> b >> c;
if (a * a == b * b + c * c) {
std::cout << "YES" << std::endl;
}
if (b * b == a * a + c * c) {
std::cout << "YES" << std::endl;
}
if (c * c == b * b + a * a) {... | #include <iostream>
int main() {
int a, b, c, i, n;
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> a >> b >> c;
if (a * a == b * b + c * c) {
std::cout << "YES" << std::endl;
} else if (b * b == a * a + c * c) {
std::cout << "YES" << std::endl;
} else if (c * c == b * b + a * a)... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 152 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "Yes" << endl;
} else if (b * b == c * c + a * a) {
cout << "Yes" << endl;
} else if (c * c == a * a... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "YES" << endl;
} else if (b * b == c * c + a * a) {
cout << "YES" << endl;
} else if (c * c == a * a... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 140 | 8 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a(3);
cin >> N;
while (N > 0) {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a.begin(), a.end());
if (pow(a[2], 2.0) == pow(a[1], 2.0) + pow(a[0], 2.0))
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a(3);
cin >> N;
while (N > 0) {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a.begin(), a.end());
if (pow(a[2], 2.0) == pow(a[1], 2.0) + pow(a[0], 2.0))
c... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 130 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
vector<int> a;
int n;
cin >> n;
while (n--) {
int t;
for (int i = 0; i < 3; i++) {
cin >> t;
a.push_back(t);
}
sort(a.begin(), a.end());
if (a[0] * a[... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
vector<int> a;
int n;
cin >> n;
while (n--) {
int t;
for (int i = 0; i < 3; i++) {
cin >> t;
a.push_back(t);
}
sort(a.begin(), a.end());
if (a[0] * a[... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 134 | 6 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
bool _bool = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
_bool = false;
if (a * a == (b * b + c * c) || b * b == a * a + b * b ||
c * c == a * a + b * b) {
_bool = true;
}
if (_bool) {
... | #include <iostream>
using namespace std;
int main() {
int a, b, c, n;
bool _bool = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
_bool = false;
if (a * a == (b * b + c * c) || b * b == a * a + c * c ||
c * c == a * a + b * b) {
_bool = true;
}
if (_bool) {
... | [["-", 31, 16, 12, 16, 12, 16, 12, 16, 31, 22], ["+", 31, 16, 12, 16, 12, 16, 12, 16, 31, 22], ["-", 31, 16, 12, 16, 12, 16, 12, 16, 12, 22], ["+", 31, 16, 12, 16, 12, 16, 12, 16, 12, 22]] | 1 | 132 | 4 |
#include <stdbool.h>
#include <stdio.h>
bool judge(int x, int y, int z) {
static bool flag = false;
if (x * x + y * y == z * z) {
flag = true;
} else if (y * y + z * z == x * x) {
flag = true;
} else if (z * z + x * x == y * y) {
flag = true;
}
return flag;
}
int main(void) {
int repeat, a, ... | #include <stdbool.h>
#include <stdio.h>
bool judge(int x, int y, int z) {
bool flag = false;
if (x * x + y * y == z * z) {
flag = true;
} else if (y * y + z * z == x * x) {
flag = true;
} else if (z * z + x * x == y * y) {
flag = true;
}
return flag;
}
int main(void) {
int repeat, a, b, c;
... | [["-", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115]] | 1 | 189 | 1 |
#include <algorithm>
#include <iostream>
bool judge_triangle(int j_edge[]) {
std::sort(j_edge, j_edge + 2);
return j_edge[2] * j_edge[2] == j_edge[0] * j_edge[0] + j_edge[1] * j_edge[1];
}
int main() {
int num;
std::cin >> num;
for (int i = 0; i < num; i++) {
int edge[3];
std::cin >> edge[0] >> ed... | #include <algorithm>
#include <iostream>
bool judge_triangle(int j_edge[]) {
std::sort(j_edge, j_edge + 3);
return j_edge[2] * j_edge[2] == j_edge[0] * j_edge[0] + j_edge[1] * j_edge[1];
}
int main() {
int num;
std::cin >> num;
for (int i = 0; i < num; i++) {
int edge[3];
std::cin >> edge[0] >> ed... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 151 | 2 |
#include <stdio.h>
int right(int x, int y, int z);
int main(void) {
int n, x, y, z;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &x, &y, &z);
if (right(x, y, z) == 1) {
printf("YES\n");
} else {
printf("NO\n");
break;
}
}
return 0;
}
int right(int x, in... | #include <stdio.h>
int right(int x, int y, int z);
int main(void) {
int n, x, y, z;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &x, &y, &z);
if (right(x, y, z) == 1) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
int right(int x, int y, int z) {... | [["-", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["-", 0, 57, 75, 76, 0, 9, 0, 93, 0, 35]] | 1 | 191 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
int a, b, c;
int tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
}
if (a > c) {
tmp = a;
a = c;
c = tmp;
}
if (b > c) {
tmp = b;
b = c;
c = tmp;
}
if (a * a + b * b == c * c)
cout << "... | #include <iostream>
using namespace std;
int main() {
int n;
int a, b, c;
int tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a > c) {
tmp = a;
a = c;
c = tmp;
}
if (b > c) {
tmp = b;
b = c;
c = tmp;
}
if (a * a + b * b == c ... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 127 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> d;
for (int i = 0; i < d; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c or b * b + c * c == a * a or
c * c + a * a == b * b) {
cout << "YES" << endl;
} else {
cout << "NO";
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> d;
for (int i = 0; i < d; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c or b * b + c * c == a * a or
c * c + a * a == b * b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
retu... | [["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 12, 22]] | 1 | 109 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a < c) {
swap(a, c);
}
if (b < c) {
swap(b, c);
}
if (a * a + b * b == c * c)
cout << "YES" << endl;
e... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a > c) {
swap(a, c);
}
if (b > c) {
swap(b, c);
}
if (a * a + b * b == c * c) {
cout << "YES" << endl;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 116 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int tate, yoko, naname;
cin >> tate >> yoko >> naname;
if (tate > naname) {
swap(tate, naname);
}
if (yoko > naname) {
swap(yoko, naname);
}
if (... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int tate, yoko, naname;
cin >> tate >> yoko >> naname;
if (tate > naname) {
swap(tate, naname);
}
if (yoko > naname) {
swap(yoko, naname);
}
if (n... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 116 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "YES" << endl;
}
if (b * b == a * a + c * c) {
cout << "YES" << endl;
}
if (c * c == b * b + a * a) {
co... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "YES" << endl;
} else if (b * b == a * a + c * c) {
cout << "YES" << endl;
} else if (c * c == b * b + a * a) {
... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 132 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int henA, henB, henC;
for (int i = 0; i < n; i++) {
cin >> henA >> henB >> henC;
if (henA, henC) {
swap(henA, henC);
}
if (henB > henC) {
swap(henB, henC);
}
if (henA * henA + h... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int henA, henB, henC;
for (int i = 0; i < n; i++) {
cin >> henA >> henB >> henC;
if (henA > henC) {
swap(henA, henC);
}
if (henB > henC) {
swap(henB, henC);
}
if (henA * henA + ... | [["-", 8, 9, 0, 57, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 116 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c1, c2, c3, i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d %d %d", &c1, &c2, &c3);
}
if (c1 * c1 + c2 * c2 == c3 * c3) {
printf("YES\n");
} else if (c1 * c1 + c3 * c3 == c2 * c2) {
printf("YES\n");
} else if (c2 * c2 + c3 * c3 == c1 * c1) ... | #include <stdio.h>
int main(void) {
int a, b, c1, c2, c3, i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d %d %d", &c1, &c2, &c3);
if (c1 * c1 + c2 * c2 == c3 * c3) {
printf("YES\n");
} else if (c1 * c1 + c3 * c3 == c2 * c2) {
printf("YES\n");
} else if (c2 * c2 + c3 * c3 == c1... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 151 | 2 |
#include <stdio.h>
int main() {
int n, a[1000], b[1000], c[1000], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < n; i++) {
if (a[i] * a[i] + b[i] * b[i] == c[i] * c[i] ||
c[i] * c[i] + b[i] * b[i] == a[i] * a[i] ||
a[i] * a[i] + ... | #include <stdio.h>
int main() {
int n, a[1000], b[1000], c[1000], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < n; i++) {
if (a[i] * a[i] + b[i] * b[i] == c[i] * c[i] ||
c[i] * c[i] + b[i] * b[i] == a[i] * a[i] ||
a[i] * a[i] + ... | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 17, 72], ["+", 51, 16, 12, 16, 31, 16, 12, 16, 17, 48]] | 1 | 209 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, n[3];
cin >> N;
for (int i = 0; i < N; i++) {
for (int m = 0; m < 3; m++) {
cin >> n[m];
}
sort(n, n + 3);
if (n[2] * n[2] == n[1] * n[1] + n[0] * n[0]) {
cout << "Yes" << endl;
} else {
cout <... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, n[3];
cin >> N;
for (int i = 0; i < N; i++) {
for (int m = 0; m < 3; m++) {
cin >> n[m];
}
sort(n, n + 3);
if (n[2] * n[2] == n[1] * n[1] + n[0] * n[0]) {
cout << "YES" << endl;
} else {
cout <... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 130 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
while (n--) {
cin >> a >> b >> c;
a = a * a;
b = b * b;
c = c * c;
if (a + b == c || b + c == a || c + a == b) {
cout << "Yes";
} else {
cout << "NO";
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
while (n--) {
cin >> a >> b >> c;
a = a * a;
b = b * b;
c = c * c;
if (a + b == c || b + c == a || c + a == b) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
}
return 0;
} | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 102 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> v;
for (int i = 0; i < n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
int max = std::max(a, std::max(b, c));
if (a * a + b * b + c * c == max * max * 2) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> v;
for (int i = 0; i < n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
int max = std::max(a, std::max(b, c));
if (a * a + b * b + c * c == max * max * 2) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47]] | 1 | 160 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, s, t, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a < b) {
d = b;
b = a;
a = d;
}
if (b < c) {
d = c;
c = b;
b = d;
}
if (a < b) {
d = b;
b = a;
... | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, s, t, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a < b) {
d = b;
b = a;
a = d;
}
if (b < c) {
d = c;
c = b;
b = d;
}
if (a < b) {
d = b;
b = a;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 166 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c || b * b == a * a + c * c ||
c * c == a * a + b * b) {
cout << "YES\n";
} else {
cout << "NO\n";
}
cout << end... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c || b * b == a * a + c * c ||
c * c == a * a + b * b) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
return 0;... | [["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 114 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 198 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
int side[3];
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> side[j];
}
for (int j = 0; j < 2; j++) {
if (side[j] >= side[j + 1]) {
int s = side[j + 1];
side[j + 1] = side[j];
... | #include <iostream>
using namespace std;
int main() {
int n;
int side[3];
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 2; j++) {
cin >> side[j];
}
for (int j = 0; j < 2; j++) {
if (side[j] >= side[j + 1]) {
int s = side[j + 1];
side[j + 1] = side[j];
... | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 187 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, array[3], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &array[0], &array[1], &array[2]);
sort(array, array + 3);
if (array[0] * array[0] + array[1] * array[1] == array[2] * arr... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, array[3], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &array[0], &array[1], &array[2]);
sort(array, array + 3);
if (array[0] * array[0] + array[1] * array[1] == array[2] * arr... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 138 | 4 |
//#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
//#include <cstdio>
//#include <cstdlib>
//#include <cmath>
#include <algorithm>
#include <iostream>
//#include <cstring>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
... | //#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
//#include <cstdio>
//#include <cstdlib>
//#include <cmath>
#include <algorithm>
#include <iostream>
//#include <cstring>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 146 | 6 |
#include <iostream>
using namespace std;
int main() {
int a = 0;
int kazu = 0;
int b = 0;
int c = 0;
for (int i = 0; i < kazu; i++) {
cin >> a;
cin >> b;
cin >> c;
if (a * a + b * b == c * c) {
cout << "YES" << endl;
} else if (a * a + c * c == b * b) {
cout << "YES" << endl;
... | #include <iostream>
using namespace std;
int main() {
int a = 0;
int kazu = 0;
int b = 0;
int c = 0;
cin >> kazu;
for (int i = 0; i < kazu; i++) {
cin >> a;
cin >> b;
cin >> c;
if (a * a + b * b == c * c) {
cout << "YES" << endl;
} else if (a * a + c * c == b * b) {
cout << "... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 148 | 4 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int times;
cin >> times;
for (int i = 0; i <= times; i++) {
int a, b, c;
cin >> a >> b >> c;
double a2, b2, c2;
a2 = pow(a, 2);
b2 = pow(b, 2);
c2 = pow(c, 2);
if (a2 == b2 + c2 || b2 == a2 + c2 || c2 == a2 + b... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int times;
cin >> times;
for (int i = 0; i < times; i++) {
int a, b, c;
cin >> a >> b >> c;
double a2, b2, c2;
a2 = pow(a, 2);
b2 = pow(b, 2);
c2 = pow(c, 2);
if (a2 == b2 + c2 || b2 == a2 + c2 || c2 == a2 + b2... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 130 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, i;
cin >> i;
for (int n = 0; n < i; n++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "Yes" << endl;
} else if (b * b == a * a + c * c) {
cout << "Yes" << endl;
} else if (c * c == a * a + b * b) {
... | #include <iostream>
using namespace std;
int main() {
int a, b, c, i;
cin >> i;
for (int n = 0; n < i; n++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c) {
cout << "YES" << endl;
} else if (b * b == a * a + c * c) {
cout << "YES" << endl;
} else if (c * c == a * a + b * b) {
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 137 | 8 |
#include <iostream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int a, b, c, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c || b * b == a * a + c * c ||
c * c == b * b + a * a)
... | #include <iostream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int a, b, c, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == b * b + c * c || b * b == a * a + c * c ||
c * c == b * b + a * a)
... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 116 | 4 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int x, a[3];
cin >> x;
for (int i = 1; i < x + 1; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int x, a[3];
cin >> x;
for (int i = 1; i < x + 1; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 132 | 4 |
#include <iostream>
bool checkTriangle(int a, int b, int c) {
if ((a >= b) && (a >= c)) {
return (a * a == (b * b + c * c));
} else if ((b >= a) && (b >= c)) {
return (b * b == (a * a + c * c));
} else {
return (c * c == (a * a + b * b));
}
}
int showResult(int a, int b, int c) {
if (checkTriang... | #include <iostream>
bool checkTriangle(int a, int b, int c) {
if ((a >= b) && (a >= c)) {
return (a * a == (b * b + c * c));
} else if ((b >= a) && (b >= c)) {
return (b * b == (a * a + c * c));
} else {
return (c * c == (a * a + b * b));
}
}
int showResult(int a, int b, int c) {
if (checkTriang... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 232 | 4 |
#include <iostream>
void printN(int N);
int main() {
int N;
std::cin >> N;
printN(N);
return 0;
}
void printN(int N) {
for (int i = 0; i < N; ++i) {
int x, y, z;
std::cin >> x >> y >> z;
if (x * x + y * y == z * z) {
std::cout << "yes" << std::endl;
} else if (y * y + z * z == x * x) {... | #include <iostream>
void printN(int N);
int main() {
int N;
std::cin >> N;
printN(N);
return 0;
}
void printN(int N) {
for (int i = 0; i < N; ++i) {
int x, y, z;
std::cin >> x >> y >> z;
if (x * x + y * y == z * z) {
std::cout << "YES" << std::endl;
} else if (y * y + z * z == x * x) {... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 174 | 8 |
#include <iostream>
using namespace std;
int check(int a, int b, int c) {
if (a * a + b * b == c * c)
return 1;
else
return 0;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
int aa, bb, cc;
cin >> a >> b >> c;
aa = a < b ? a : b;
bb = a < b ? b : a;
... | #include <iostream>
using namespace std;
int check(int a, int b, int c) {
if (a * a + b * b == c * c)
return 1;
else
return 0;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
int aa, bb, cc;
cin >> a >> b >> c;
aa = a < b ? a : b;
bb = a < b ? b : a;
... | [["-", 0, 1, 0, 11, 12, 41, 15, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 41, 15, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 41, 75, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 75, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 41, 64, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 64, 22]] | 1 | 168 | 8 |
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0003&lang=jp
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
if (b < a) {
int t = b;
b = a;
a = t;
}
if (c < b) {
int t = ... | #include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0003&lang=jp
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
if (b < a) {
int t = b;
b = a;
a = t;
}
if (c < b) {
int t = ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 122 | 2 |
#include <iostream>
void checkTringle(int a, int b, int c) {
if (a * a == b * b + c * c) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
int main(int argc, char *argv[]) {
int dataSize;
std::cin >> dataSize;
int side[3];
for (int i = 0; i < dataSize; i++) {
... | #include <iostream>
void checkTringle(int a, int b, int c) {
if (a * a == b * b + c * c) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
int main(int argc, char *argv[]) {
int dataSize;
std::cin >> dataSize;
int side[3];
for (int i = 0; i < dataSize; i++) {
... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 43, 49, 50, 51, 69, 341, 342, 0, 22], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, ... | 1 | 220 | 8 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == c * c + b * b || b * b == c * c + a * a ||
c * c == a * a + b * b)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a == c * c + b * b || b * b == c * c + a * a ||
c * c == a * a + b * b)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
} | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 107 | 4 |
#include <bits/stdc++.h>
using namespace std;
/*-------------------------------*/
#define FOR(i, a, b) for (int i = (a); i < (b); i++) // a~(b - 1)?????§
#define print(i) cout << i << endl //?°??????????Python?????????
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
/*-----------------... | #include <bits/stdc++.h>
using namespace std;
/*-------------------------------*/
#define FOR(i, a, b) for (int i = (a); i < (b); i++) // a~(b - 1)?????§
#define print(i) cout << i << endl //?°??????????Python?????????
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
/*-----------------... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 153 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int l[3];
cin >> l[0] >> l[1] >> l[2];
sort(l, l + 3);
if (l[2] * l[2] == l[1] * l[1] + l[0] * l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
re... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int l[3];
cin >> l[0] >> l[1] >> l[2];
sort(l, l + 3);
if (l[2] * l[2] == l[1] * l[1] + l[0] * l[0])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ret... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 121 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, j, n, a, b, c;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a == double(sqrt(pow(b, 2) + pow(c, 2)))) {
cout << "Yes" << endl;
}
else if (b == double(sqrt(pow(a, 2) + pow(c, 2)))) {
cout ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, n, a, b, c;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a == double(sqrt(pow(b, 2) + pow(c, 2)))) {
cout << "YES" << endl;
}
else if (b == double(sqrt(pow(a, 2) + pow(c, 2)))) {
cout << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 172 | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
for (int b = 0; b < a; b++) {
vector<int> c(3);
for (int d = 0; d < 3; d++)
cin >> c[d];
sort(c.begin(), c.end());
if (c[0] * c[0] + c[1] * c[1] == c[2] * c[2])
cout << "Yes" << endl;
else
cout << "N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
for (int b = 0; b < a; b++) {
vector<int> c(3);
for (int d = 0; d < 3; d++)
cin >> c[d];
sort(c.begin(), c.end());
if (c[0] * c[0] + c[1] * c[1] == c[2] * c[2])
cout << "YES" << endl;
else
cout << "N... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 129 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 160 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
scanf("%d", &a);
vector<int> b(3);
for (int c = 0; c < a; c++) {
scanf("%d%d%d", &b[0], &b[1], &b[2]);
sort(b.begin(), b.end());
if (b[0] * b[0] + b[1] * b[1] == b... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
scanf("%d", &a);
vector<int> b(3);
for (int c = 0; c < a; c++) {
scanf("%d%d%d", &b[0], &b[1], &b[2]);
sort(b.begin(), b.end());
if (b[0] * b[0] + b[1] * b[1] == b... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 147 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a[3], b;
cin >> b;
for (int i = 0; i < b; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
b = pow(a[1], 2) + pow(a[0], 2);
if (pow(a[2], 2) == b) {
cout << "YES";
} else {
cout << "... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a[3], b, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
b = pow(a[1], 2) + pow(a[0], 2);
if (pow(a[2], 2) == b) {
cout << "YES";
} else {
cout <... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 130 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, j = 0;
int a[3];
cin >> n;
while (j < n) {
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[2] * a[2] == a[1] * a[1] + a[0] * a[0]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j = 0;
int a[3];
cin >> n;
while (j < n) {
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[2] * a[2] == a[1] * a[1] + a[0] * a[0]) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 125 | 4 |
#include <iostream>
#include <string>
using namespace std;
bool IsRightTriangle(const int a, const int b, const int c) {
if (a <= b) {
if (b <= c) {
if (c * c == a * a + b * b) {
return true;
} else {
return false;
}
} else {
if (b * b == c * c + a * a) {
retur... | #include <iostream>
#include <string>
using namespace std;
bool IsRightTriangle(const int a, const int b, const int c) {
if (a <= b) {
if (b <= c) {
if (c * c == a * a + b * b) {
return true;
} else {
return false;
}
} else {
if (b * b == c * c + a * a) {
retur... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 233 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s = 0;
cin >> n;
while (n >= s) {
int i = 0, k = 0, j = 0, l = 0;
cin >> i >> k >> j;
if (i < k) {
l = i;
i = k;
k = l;
}
if (i < j) {
l = i;
i = j;
j = l;
}
i = i * i... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s = 1;
cin >> n;
while (n >= s) {
int i = 0, k = 0, j = 0, l = 0;
cin >> i >> k >> j;
if (i < k) {
l = i;
i = k;
k = l;
}
if (i < j) {
l = i;
i = j;
j = l;
}
i = i * i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 150 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define L(_i, _N) for (int _i = 0; _i < _N; _i++)
typedef long long int lli;
using namespace std;
int main() {
int N, Line[3];
cin >> N;
L(i, N) {
L(j, 3) cin >> Line[j];
sort(Line, Line +... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define L(_i, _N) for (int _i = 0; _i < _N; _i++)
typedef long long int lli;
using namespace std;
int main() {
int N, Line[3];
cin >> N;
L(i, N) {
L(j, 3) cin >> Line[j];
sort(Line, Line +... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 130 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
int n;
cin >> n;
vector<int> vx, vy, vz;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
vx.push_back(x);
vy.push_back(y);
vz.push_bac... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
int n;
cin >> n;
vector<int> vx, vy, vz;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
vx.push_back(x);
vy.push_back(y);
vz.push_bac... | [["-", 64, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 11, 12, 5, 0, 6]] | 1 | 214 | 4 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <u... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <u... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 4,405 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[3];
while (cin >> a[0] >> a[1] >> a[2]) {
sort(a, a + 3);
if ((a[0] * a[0]) + (a[1] * a[1]) == (a[2] * a[2]))
cout << "yes" << endl;
else
cout << "no" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[3];
while (cin >> a[0] >> a[1] >> a[2]) {
sort(a, a + 3);
if ((a[0] * a[0]) + (a[1] * a[1]) == (a[2] * a[2]))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
} | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 115 | 4 |
#include <iostream>
using namespace std;
void triangle_check(int max, int x, int y);
int main() {
int n, a, b, c;
cin >> n;
while (n-- > 0) {
cin >> a >> b >> c;
if (a > b) {
if (a > c) {
triangle_check(a, b, c);
} else {
triangle_check(c, a, b);
}
} else {
... | #include <iostream>
using namespace std;
void triangle_check(int max, int x, int y);
int main() {
int n, a, b, c;
cin >> n;
while (n-- > 0) {
cin >> a >> b >> c;
if (a > b) {
if (a > c) {
triangle_check(a, b, c);
} else {
triangle_check(c, a, b);
}
} else {
... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 172 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N;
int a[3];
int b, c, d;
int main() {
for (int i = 0; i < N; ++i) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
b = a[0] * a[0];
c = a[1] * a[1];
d = a[2] * a[2];
if (b + c == d) {
cout << "YES" << endl;
} else {
cout << "NO... | #include <bits/stdc++.h>
using namespace std;
int N;
int a[3];
int b, c, d;
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
b = a[0] * a[0];
c = a[1] * a[1];
d = a[2] * a[2];
if (b + c == d) {
cout << "YES" << endl;
} else {
... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 135 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a + c * c == b * b ||
b * b + c * c == a * a) {
cout... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a + c * c == b * b ||
b * b + c * c == a * a) {
cout... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 119 | 4 |
#include <iostream>
using namespace std;
int main() {
int N = 0, a, b, c, d = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
if (a < b) {
d = a;
a = b;
b = d;
d = 0;
}
if (a < c) {
d = a;
a = c;
c = d;
d = 0;
}
if (a * a == b ... | #include <iostream>
using namespace std;
int main() {
int N = 0, a, b, c, d = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
if (a < b) {
d = a;
a = b;
b = d;
d = 0;
}
if (a < c) {
d = a;
a = c;
c = d;
d = 0;
}
if (a * a == b ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 141 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a, b, c;
cin >> a >> b >> c;
a *= a;
b *= b;
c *= c;
if (a == b + c || b == a + c || c == a + b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a, b, c;
cin >> a >> b >> c;
a *= a;
b *= b;
c *= c;
if (a == b + c || b == a + c || c == a + b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 106 | 4 |
//-------------
// include
//-------------
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
//-------------
// typedef
//-------------
typedef long long LL;
typedef vector<int> VI;
typed... | //-------------
// include
//-------------
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
//-------------
// typedef
//-------------
typedef long long LL;
typedef vector<int> VI;
typed... | [["+", 8, 9, 0, 9, 0, 1, 0, 16, 31, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 16, 17, 152], ["+", 8, 9, 0, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 9, 0, 1, 0, 35]] | 1 | 288 | 4 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int a[3], n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &a[j]);
}
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
printf("Yes\n");
else
printf... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int a[3], n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &a[j]);
}
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
printf("YES\n");
else
printf... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 135 | 4 |
#include <stdio.h>
int main() {
int a, b, c, N, t, A, B, C;
scanf("%d", &N);
for (t = 0; t < N; t++) {
scanf("%d %d %d", &a, &b, &c);
A = a * a - b * b - c * c;
B = b * b - c * c - b * b;
C = c * c - a * a - b * b;
if (A == 0 || B == 0 || C == 0) {
printf("YES\n");
} else
... | #include <stdio.h>
int main() {
int a, b, c, N, t, A, B, C;
scanf("%d", &N);
for (t = 0; t < N; t++) {
scanf("%d %d %d", &a, &b, &c);
A = a * a - b * b - c * c;
B = b * b - c * c - a * a;
C = c * c - a * a - b * b;
if (A == 0 || B == 0 || C == 0) {
printf("YES\n");
} else
... | [["-", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 12, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 22]] | 1 | 144 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> on, tw, th;
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
std::cin >> a >> b >> c;
on.emplace_back(a);
tw.emplace_back(b);
th.emplace_back(c);
}
for (int i = 0; i < n; i++) {
i... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> on, tw, th;
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
std::cin >> a >> b >> c;
on.emplace_back(a);
tw.emplace_back(b);
th.emplace_back(c);
}
for (int i = 0; i < n; i++) {
i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 211 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
a = a * a;
b = b * b;
c = c * c;
if ((a == b + c) || (b == a + c) || (c == a + b)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
r... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
a = a * a;
b = b * b;
c = c * c;
if ((a == b + c) || (b == a + c) || (c == a + b)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 114 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c;
while (N--) {
cin >> a >> b >> c;
int l = max(a, max(b, c));
int x, y;
if (a == l) {
x = b;
y = c;
} else if (b == l) {
x = a;
y = c;
} else if ... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c;
while (N--) {
cin >> a >> b >> c;
int l = max(a, max(b, c));
int x, y;
if (a == l) {
x = b;
y = c;
} else if (b == l) {
x = a;
y = c;
} else if ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 160 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
static long long a, b[3] = {0};
cin >> a;
for (int A = 0; A < a; A++) {
cin >> b[0] >> b[1] >> b[2];
sort(b, b + 3);
b[0] *= b[0];
b[1] *= b[1];
b[2] *= b[2];
if (b[2] != b[0] + b[1])
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
static long long a, b[3] = {0};
cin >> a;
for (int A = 0; A < a; A++) {
cin >> b[0] >> b[1] >> b[2];
sort(b, b + 3);
b[0] *= b[0];
b[1] *= b[1];
b[2] *= b[2];
if (b[2] != b[0] + b[1])
cout << "NO" << endl;
... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 141 | 4 |
#include <iostream>
int main(int argc, char **argv) {
int num, i, a, b, c;
std::cin >> num;
for (i = 0; i < num; i++) {
std::cin >> a >> b >> c;
if (a * a + b * b == c * c && b * b + c * c == a * a &&
c * c + a * a == b * b) {
std::cout << "YES" << std::endl;
} else {
std::cout ... | #include <iostream>
int main(int argc, char **argv) {
int num, i, a, b, c;
std::cin >> num;
for (i = 0; i < num; i++) {
std::cin >> a >> b >> c;
if (a * a + b * b == c * c || b * b + c * c == a * a ||
c * c + a * a == b * b) {
std::cout << "YES" << std::endl;
} else {
std::cout ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 106], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 124 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
int d = a * a;
int e = b * b;
int f = c * c;
if ((d = e + f) || (e = d + f) || (f = d + e))
cout << "YES" << endl;
else
cout... | #include <cmath>
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
int d = a * a;
int e = b * b;
int f = c * c;
if ((d == e + f) || (e == d + f) || (f == d + e))
cout << "YES" << endl;
else
c... | [["-", 51, 16, 31, 16, 31, 23, 0, 42, 0, 32], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 60], ["-", 51, 16, 31, 16, 12, 23, 0, 42, 0, 32], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 17, 60], ["-", 15, 339, 51, 16, 12, 23, 0, 42, 0, 32], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 60]] | 1 | 119 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int a, b, c;
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (b > c)
swap(b, c);
if (a > b)
swap(a, b);
if (a * a + b * b == c) {
cout << "YES" << endl;
} else {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int a, b, c;
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (b > c)
swap(b, c);
if (a > b)
swap(a, b);
if (a * a + b * b == c * c) {
cout << "YES" << endl;
} else {
co... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 48], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 113 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nIn[3] = {0};
while (nNum--) {
cin >> nIn[0] >> nIn[1] >> nIn[2];
int nMax = max(max(nIn[0], nIn[1]), nIn[2]);
if (nMax * nMax * 2 ==
nIn[0] * nIn[0] + nIn[1] * nIn[2] + nIn[2] * nIn[2]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nIn[3] = {0};
while (nNum--) {
cin >> nIn[0] >> nIn[1] >> nIn[2];
int nMax = max(max(nIn[0], nIn[1]), nIn[2]);
if (nMax * nMax * 2 ==
nIn[0] * nIn[0] + nIn[1] * nIn[1] + nIn[2] * nIn[2]... | [["-", 31, 16, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 31, 16, 12, 16, 12, 69, 341, 342, 0, 13]] | 1 | 143 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nIn[3] = {0};
while (nNum--) {
cin >> nIn[0] >> nIn[1] >> nIn[2];
int nMax = max(max(nIn[0], nIn[1]), nIn[2]);
if (nMax == nIn[2]) {
swap(nIn[2], nIn[0]);
} else if (nMax == nIn[1]) {... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nIn[3] = {0};
while (nNum--) {
cin >> nIn[0] >> nIn[1] >> nIn[2];
int nMax = max(max(nIn[0], nIn[1]), nIn[2]);
if (nMax == nIn[2]) {
swap(nIn[2], nIn[0]);
} else if (nMax == nIn[1]) {... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 186 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (b > c)
swap(b, c);
if (a > b)
swap(a, b);
if (a * a + b ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (b > c)
swap(b, c);
if (a > b)
swap(a, b);
if (a * a + b ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 131 | 4 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a + c * c <= b * b... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a + c * c == b * b... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60]] | 1 | 124 | 4 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, n, i;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (a > c) {
swap(a, c);
}
if (b > c) {
swap(b, c);
}
if (c * c == a * a + b * b) {
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
int a, b, c, n, i;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (a > c) {
swap(a, c);
}
if (b > c) {
swap(b, c);
}
if (c * c == a * a + b * b) {
cout << "YES" <... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 130 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int caso;
int lado_1, lado_2, lado_3;
vector<int> triangle;
cin >> caso;
for (int index = 0; index < caso; ++index) {
cin >> lado_1 >> lado_2 >> lado_3;
triangle.push_back(lado_1);
triangle.push_back(lado_2);
triangle.push_back(la... | #include <bits/stdc++.h>
using namespace std;
int main() {
int caso;
int lado_1, lado_2, lado_3;
vector<int> triangle;
cin >> caso;
for (int index = 0; index < caso; ++index) {
triangle.clear();
cin >> lado_1 >> lado_2 >> lado_3;
triangle.push_back(lado_1);
triangle.push_back(lado_2);
... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 144 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i];
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
cout << "YES" << endl;
else
cout << "NO" << endl... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[j];
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
cout << "YES" << endl;
else
cout << "NO" << endl... | [["-", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 121 | 2 |
#include <stdio.h>
main() {
int x, i, j, k;
int a[3];
scanf("%d", &i);
for (; i > 0; i--) {
for (j = 0; j < 3; j++) {
scanf("%d", &a[j]);
}
for (j = 0; j <= 2; j++) {
for (k = j + 1; k <= 3; k++) {
if (a[j] < a[k]) {
x = a[j];
a[j] = a[k];
a[k] = ... | #include <stdio.h>
main() {
int x, i, j, k;
int a[3];
scanf("%d", &i);
for (; i > 0; i--) {
for (j = 0; j < 3; j++) {
scanf("%d", &a[j]);
}
for (j = 0; j < 2; j++) {
for (k = j + 1; k < 3; k++) {
if (a[j] < a[k]) {
x = a[j];
a[j] = a[k];
a[k] = x;... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 198 | 4 |
#include <iostream>
using namespace std;
void solve() {
int t;
cin >> t;
while (t--) {
int Data[3];
for (int i = 0; i < 3; ++i) {
cin >> Data[i];
}
if ((Data[0] * Data[0] + Data[1] * Data[1] == Data[2] * Data[2]) ||
(Data[1] * Data[1] + Data[2] * Data[2] == Data[1] * Data[1]) ||
... | #include <iostream>
using namespace std;
void solve() {
int t;
cin >> t;
while (t--) {
int Data[3];
for (int i = 0; i < 3; ++i) {
cin >> Data[i];
}
if ((Data[0] * Data[0] + Data[1] * Data[1] == Data[2] * Data[2]) ||
(Data[1] * Data[1] + Data[2] * Data[2] == Data[0] * Data[0]) ||
... | [["-", 0, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["+", 0, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["-", 0, 16, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 0, 16, 12, 16, 12, 69, 341, 342, 0, 13]] | 1 | 189 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N = 0;
int a, b, c;
string y = "YES";
string n = "NO";
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a - b * b == c * c || b * b - a * a) {
cout << y << endl;
} else... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N = 0;
int a, b, c;
string y = "YES";
string n = "NO";
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a >> b >> c;
if (a * a + b * b == c * c || a * a - b * b == c * c ||
b * b - a * a == c * c) {
cout << y <<... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 48], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 22]] | 1 | 119 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int T;
scanf("%d", &T);
for (int t = 0; t < T; t++) {
int edge[3];
printf("%d %d %d", edge, edge + 1, edge + 2);
sort(edge, edge + 3, greater<int>());
if (edge[0] * edge[0] == edge[1] * edge[1] + edge[2] ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int T;
scanf("%d", &T);
for (int t = 0; t < T; t++) {
int edge[3];
scanf("%d %d %d", edge, edge + 1, edge + 2);
sort(edge, edge + 3, greater<int>());
if (edge[0] * edge[0] == edge[1] * edge[1] + edge[2] *... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 148 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
while (d > 0) {
int num[3];
for (int i = 0; i < 3; i++) {
cin >> num[i];
}
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 3; j++) {
if (num[i] > num[j]) {
int q = num[i... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
while (d > 0) {
int num[3];
for (int i = 0; i < 3; i++) {
cin >> num[i];
}
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 3; j++) {
if (num[i] > num[j]) {
int q = num[i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 187 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 2);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 122 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int N;
int Side[3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &Side[j]);
}
sort(Side, Side + 3);
if (Side[0] * Side[0] == Side[1] * Side[1] + Side[2] * Side[2])
prin... | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
int Side[3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &Side[j]);
}
sort(Side, Side + 3);
if (Side[2] * Side[2] == Side[1] * Side[1] + Side[0] * Side[0])
prin... | [["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 13], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 13], ["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["-", 12, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["+", 12, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["-", 12, 16, 12, 16, 12, 69, 3... | 1 | 139 | 8 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 199 | 6 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, x, y, z, n;
// read in n
cin >> n;
// for n set of data, read into 3 sides
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
x = a * a;
y = b * b;
z = c * c;
// check if they are triangle
if (x + y == z || x + z =... | #include <iostream>
using namespace std;
int main() {
int a, b, c, x, y, z, n;
// read in n
cin >> n;
// for n set of data, read into 3 sides
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
x = a * a;
y = b * b;
z = c * c;
// check if they are triangle
if (x + y == z || x + z =... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 116 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
int max = a, k = b, l = c;
if (max < b) {
max = b;
k = a;
} else if (max < c) {
max = c;
l = a;
}
if (max * max == k * k + l * l)
... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
int max = a, k = b, l = c;
if (max < b) {
max = b;
k = a;
}
if (max < c) {
max = c;
k = b;
l = a;
}
if (max * max == k * ... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 129 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[5];
int t;
cin >> t;
while (t--) {
for (int i = 0; i < 3; ++i) {
cin >> a[i];
}
sort(a, a + 2);
int t1, t2, t3;
t1 = a[2];
t2 = a[1];
t3 = a[0];
if (t1 * t1 == t2 * t2 + t3 * t3) {
cout ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[5];
int t;
cin >> t;
while (t--) {
for (int i = 0; i < 3; ++i) {
cin >> a[i];
}
sort(a, a + 3);
int t1, t2, t3;
t1 = a[2];
t2 = a[1];
t3 = a[0];
if (t1 * t1 == t2 * t2 + t3 * t3) {
cout ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 130 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.