//input a,b,c 1<= <=30000
//a=b=c end
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
long list[3];
while (cin >> list[0] >> list[1] >> list[2]){
if (list[0] == 0 && list[1] == 0 && list[2] == 0){
break;
}
//solution
//90 "right"
//not 90 "wrong"
sort(list,list+3);
if (list[0]*list[0] + list[1]*list[1] == list[2]*list[2]){
cout << "right" << endl;
}else{
cout << "wrong" << endl;
}
}
return 0;
}
参考: 1️⃣c++数组排序的五种方法-CSDN博客
收获:1️⃣复习数组排序 sort(...,...) 头文件<algorithm>
菜菜,不是教程,做题和学习记录