# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
5630 | | gs13073 | 개미 (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){return x>y?y:x;}
int main()
{
int T;
scanf("%d",&T);
long long a,b,c;
while(T--){
scanf("%lld %lld %lld",&a,&b,&c);
long long l=(a+b)*(a+b)+c*c;
long long ll=a*a+(b+c)*(b+c);
long long lll=(a+c)*(a+c)+b*b;
printf("%lld\n",min(min(l,ll),lll));
}
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... |