Cod sursa(job #1404639)
| Utilizator | Data | 28 martie 2015 13:43:56 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<cstdio>
int a[2][65281],i,j,n,m,k,p;
int main ()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d",&n,&p);
if(p<=32640&&p>=-32640)
{
a[0][32640]=1;
a[1][32641]=a[1][32639]=1;
for(i=2;i<n;i++)
{
for(j=-i*(i+1)/2;j<=i*(i+1)/2;j++)
a[i%2][j+32640]=(a[(i-1)%2][j-i+32640]+a[(i-1)%2][j+i+32640])%194767;
}
printf("%d",a[(i-1)%2][p+32640]);
}
else
printf("0");
return 0;
}
