Cod sursa(job #1235559)
| Utilizator | Data | 29 septembrie 2014 23:16:54 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
#define SMax 32640 + 5
#define MOD 194767
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,s;
int D[2][SMax];
int main()
{
int i,j;
f>>n>>s;
D[0][0]=1;
int t=0;
for(i=2;i<=n;i++)
{
t+=i-1;
for(j=0;j<=t;j++) D[1][j]=(D[0][abs(j-i+1)]+D[0][abs(j+i-1)])%MOD;
for(j=0;j<=t;j++) D[0][j]=D[1][j];
}
g<<D[0][abs(s)]<<"\n";
f.close();
g.close();
return 0;
}
