Mai intai trebuie sa te autentifici.
Cod sursa(job #829410)
| Utilizator | Data | 5 decembrie 2012 12:51:09 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<fstream>
#include<cstdlib>
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,i,p,s,j,smax,a[3][50000];
/*int abs(int x)
{
if(x>0)
return x;
return -x;
}*/
int main()
{
f>>n>>s;
f.close();
smax=n*(n-1);
if(smax<abs(s))
{
g<<0<<'\n';
return 0;
}
a[0][0]=1;
p=1;
for(i=2;i<=n;p=p^1,++i)
for(j=0;j<=smax;++j)
{
a[p][j]=a[p^1][j+i-1]+a[p^1][abs(j-i+1)];
if(a[p][j]>=MOD)
a[p][j]-=MOD;
}
g<<a[(n%2)^1][s]<<'\n';
return 0;
}
