# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
7061 | | gs14004 | 개미 (GA4_ant) | C++98 | | 60 ms | 1088 KiB |
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 <cstdio>
#include <algorithm>
using namespace std;
long long a,b,c;
long long v1,v2,v3;
int main(){
int tc;
scanf("%d",&tc);
for (int i=0; i<tc; i++) {
scanf("%lld %lld %lld",&a,&b,&c);
v1 = (a+b)*(a+b)+c*c;
v2 = (a+c)*(a+c)+b*b;
v3 = (b+c)*(b+c)+a*a;
printf("%lld\n",min(v1,min(v2,v3)));
}
}
# | 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... |