# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987471 | activedeltorre | Semafor (COI20_semafor) | C++14 | 107 ms | 496 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 <iostream>
using namespace std;
long long nr1[2300];
long long nr2[2300];
long long cif(long long val)
{
if(val==1)
{
return 1;
}
else if(val==2)
{
return 6;
}
else if(val==3)
{
return 21;
}
else if(val==4)
{
return 9;
}
else if(val==5)
{
return 28;
}
else if(val==6)
{
return 18;
}
else if(val==7)
{
return 5;
}
else if(val==8)
{
return 30;
}
else if(val==9)
{
return 29;
}
else
return 3;
}
long long getid(long long val)
{
return cif(val/10)*32+cif(val%10);
}
long long mod=1e9+7;
long long nmax=1023;
int main()
{
long long n,i,j,k,l,m,st,val,z;
cin>>m>>n>>k>>st;
val=getid(st);
nr1[val]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<=nmax;j++)
{
for(z=0;z<=9;z++)
{
val=1<<z;
nr2[j^val]+=nr1[j];
}
}
for(j=0;j<=nmax;j++)
{
nr1[j]=nr2[j]%mod;
}
/*
if(i%k==0)
{
for(j=0;j<=9;j++)
{
nr1[getid(j)]*=2;
}
for(j=0;j<=nmax;j++)
{
nr1[j]-=nr2[j];
}
}*/
for(j=0;j<=nmax;j++)
{
nr2[j]=0;
}
}
for(i=0;i<=99;i++)
{
cout<<nr1[getid(i)]%mod<<'\n';
}
return 0;
}
Compilation message (stderr)
# | 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... |