QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#370463 | #5038. City | zzuqy# | WA | 0ms | 3784kb | C++11 | 402b | 2024-03-29 08:23:46 | 2024-03-29 08:23:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long read()
{
long long x;scanf("%lld",&x);return x;
}
long long ans;
int n,m;
int main()
{
n=read();m=read();
for(int i=2;i<=max(n,m)+1;i+=2)
{
if(n+1>=i)
{
ans=ans+m*(n+1-i+1);
}
if(m+1>=i)
{
ans=ans+n*(m+1-i+1);
}
}
cout<<ans;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3784kb
input:
1 1
output:
2
result:
wrong answer 1st numbers differ - expected: '0', found: '2'