Cod sursa(job #1651725)
Utilizator | Data | 13 martie 2016 19:23:28 | |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define MOD 194767
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
int m[2][66000];
int main() {
int n,s;
in >> n >> s;
m[0][0] = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= s; j++)
m[1][j] = (m[0][abs(j-(i-1))]+m[0][abs(j+(i-1))])%MOD;
for(int j = 1; j <= s; j++)
m[0][j] = m[1][j];
}
out << m[0][s];
return 0;
}