Pagini recente » Rezultatele filtrării | Borderou de evaluare (job #1488477) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #2271121)
#include <fstream>
#include <iostream>
using namespace std;
int n, s, t[2][66000], st, dr, m=33000, mod=194767;
int main(){
int i, j;
ifstream fin ("1-sir.in");
fin >> n >> s;
t[0][m]=1; st=m; dr=m;
for (i=1; i<=n; i++){
for (j=st; j<=dr; j++){
t[1][j+1]+=t[0][j]; t[1][j+1]%=mod;
t[1][j-1]+=t[0][j]; t[1][j-1]%=mod;
}
st--; dr++;
for (j=st; j<=dr; j++)
t[0][j]=t[1][j];
}
fin.close();
ofstream fout ("1-sir.out");
fout << t[0][m+s];
fout.close();
return 0;
}