Cod sursa(job #1404023)
Utilizator | Data | 27 martie 2015 18:43:23 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
#define MOD 194767
using namespace std;
long v[2][70000];
int main()
{
ifstream in("1-sir.in");
ofstream out("1-sir.out");
long n, s, i, j;
in>>n>>s;
v[1][0]=1;
for(i=2;i<=n;++i)
for(j=0;j<=i*(i-1)/2;++j)
v[i%2][j]=(v[(i+1)%2][j+i-1]+v[(i+1)%2][abs(j-i+1)])%MOD;
out<<v[(i+1)%2][s];
return 0;
}