# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
6788 | | Qwaz | 개미 (GA4_ant) | C++98 | | 56 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;
int main(){
int numCase;
scanf("%d", &numCase);
int i;
for(i = 0; i<numCase; i++){
scanf("%lld%lld%lld", &a, &b, &c);
printf("%lld\n", min((a+b)*(a+b)+c*c, min((a+c)*(a+c)+b*b, (b+c)*(b+c)+a*a)));
}
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... |