| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 7793 | Fakeable | 다각형 (GA5_polygon) | C++98 | 0 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>
int main()
{
int n,n_,m;
long long int sum=0;
scanf("%d %d",&n,&m);
n_=n;
m/=2;
if(n%2==0) n/=2;
else n=n/2+1;
sum=2*(m*(m+1)/2-n*(n-1)/2);
if(n_<3) sum-=2;
printf("%lld",sum);
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... | ||||