This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
ll sq (ll x) {
return x*x;
}
int main() {
int tc; scanf("%d", &tc);
while(tc--) {
ll a[3]; for(int i = 0; i < 3; i++) scanf("%lld", a+i);
sort(a, a+3);
ll r = sq(a[0]+a[1]) + sq(a[2]);
printf("%lld\n", r);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |