Pagini recente » Cod sursa (job #199964) | Cod sursa (job #2005893) | Atasamentele paginii Clasament simulareojiclasa7 | Cod sursa (job #205956) | Cod sursa (job #1771840)
#include<fstream>
#define mod 194767
using namespace std;
int n, s, i, j, k, x, y, val;
int a[2][2 * 256 * 256];
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int main(){
fin>> n >> s;
if(n * (n - 1) / 2 < s || s < -n * (n - 1) / 2){
fout<<"0\n";
return 0;
}
a[0][s] = 1;
k = 1;
for(i = 2; i <= n; i++){
val = n - i + 1;
for(j = -s; j <= s; j++){
a[k][j] = 0;
if(j - val >= x){
a[k][j + s] = a[1 - k][j - val + s];
}
if(j + val <= y){
a[k][j + s] = (a[k][j + s] + a[1 - k][j + s + val]) % mod;
}
}
k = 1 - k;
}
fout<< a[1 - k][s + s] <<"\n";
return 0;
}