Mai intai trebuie sa te autentifici.
Cod sursa(job #1484083)
| Utilizator | Data | 10 septembrie 2015 14:32:57 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <cstdio>
#include <cmath>
#define MOD 194767
using namespace std;
int nMax,n,S,i,j,sol,l,p;
int D[2][40000];
int main()
{
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d%d", &n, &S);
nMax=n*(n-1)/2;
D[0][0]=1;
for(i=2;i<=n;i++)
{
for(j=0;j<=nMax;j++)
{
p=j-i+1;
D[!l][j]=D[l][j+i-1];
if(p<0)
p=0-p;
D[!l][j]+=D[l][p];
if(D[!l][j]>=MOD)
D[!l][j]-=MOD;
}
l=!l;
}
sol=D[l][S];
printf("%d", sol);
return 0;
}
