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 int min (long long int a, long long int b, long long int c)
{
if (a <= b && a <= c)
return a;
else if (b <= a && b <= c)
return b;
return c;
}
int main ()
{
int n;
scanf ( "%d", &n);
for (int i = 0; i < n; ++i)
{
long long int s1, s2, s3;
scanf ("%lld %lld %lld", &s1, &s2, &s3);
long long int sol;
sol = min (s1 * s1 + (s2 + s3) * (s2 + s3), (s1 + s2) * (s1 + s2) + s3 * s3, (s1 + s3) * (s1 + s3) + s2 * s2);
printf ("%lld\n", sol);
}
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... |