# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
6800 | | qja0950 | 개미 (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 <stdio.h>
long long MIN(long long x, long long y) {
if(x>y) return y;
else return x;
}
int main() {
int T;
scanf("%d", &T);
for(int i=1; i<=T; i++) {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
printf("%lld\n",
MIN((a+b)*(a+b)+c*c,
MIN((b+c)*(b+c)+a*a, (c+a)*(c+a)+b*b)));
}
}
# | 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... |