Cod sursa(job #842167)
| Utilizator | Data | 26 decembrie 2012 13:17:52 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
#define mod 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int ab(int a)
{
if(a<0)
return -a;
return a;
}
int D[2][40000],SMAX,n,p,i,j;
long long s;
int main ()
{
f>>n>>s;
SMAX=n*(n-1)/2;
if(s>n*(n-1)/2)
g<<0;
else
{
p=1;
D[p][0]=1;
for(i=2;i<=n;++i)
{
for(j=0;j<=SMAX;++j)
{
D[!p][j]=D[p][j+i-1]+D[p][ab(j-(i-1))];
if(D[!p][j]>=mod)
D[!p][j]-=mod;
}
p=!p;
}
g<<D[p][s];
}
return 0;
} 