Pagini recente » Cod sursa (job #1523944) | Cod sursa (job #2816985) | Cod sursa (job #3229570) | Cod sursa (job #1515093) | Cod sursa (job #2876987)
#include <fstream>
using namespace std;
ifstream f("in");
ofstream g("out");
int n,p,t,i,j,k,s[10001],a[1001][1001];
int main()
{
f>>n>>p>>t;
for(i=1;i<=t;i++)
{a[1][i]=1;
s[1]=s[1]+a[1][i];}
a[1][2]=0;
for(k=2;k<=n;k++)
{
for(i=1;i<=t;i++)
{if (i==2)
a[k][i]=a[k-1][3]+a[k-1][4];
if(i==1)
{a[k][i]=s[k-1];
for(j=1;j<=p;j++)
a[k][i]=a[k][i]-a[k-j][i];
}
if(i==3)
a[k][i]=s[k-1]-a[k-2][4];
if(i==4)
a[k][i]=s[k-1]-a[k-2][3];
if(i>4)
a[k][i]=s[k-1]-a[i][2];
}
for(i=1;i<=t;i++)
s[k]=(s[k]+a[k][i])%666013;
}
for(i=1;i<=n;i++)
{for(j=1;j<=t;j++)
g<<a[i][j]<<" ";
g<<'\n';}
g<<s[n];
return 0;
}