Cod sursa(job #391623)
| Utilizator | Data | 5 februarie 2010 23:13:35 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<stdio.h>
#define BIG 32640
#define BIGG 65280
#define MOD 194767
int A[2][2*BIG+2];
int main(){
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
int N,S;
scanf("%d%d",&N,&S);
A[0][BIG]=1;
int i,j,k1=1,k2=0;
for( i=1; i<=N; ++i )
{
k1^=k2;k2^=k1;k1^=k2;
for( j=1; j<=BIGG; ++j )
{
A[k2][j]=(A[k1][j-1]+A[k1][j+1])%MOD;
}
}
printf("%d\n",A[k2][S+BIG]);
return 0;
}