# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
15099 | | ggoh | 씽크스몰 (kriii3_TT) | C++98 | | 10000 ms | 32332 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>
long long n,m,i,j,s;
long long a[1000002],b[1000002],c[2000002];
main()
{
scanf("%lld%lld",&n,&m);
for(i=0;i<=n;i++)
{
scanf("%lld",&a[i]);
}
for(j=0;j<=m;j++)
{
scanf("%lld",&b[j]);
}
for(i=0;i<=n;i++)
{
for(j=0;j<=m;j++)
{
c[i+j]+=a[i]*b[j];
}
}
s=c[0];
for(i=1;i<=n+m;i++)
{
s^=c[i];
}
printf("%lld",s);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |