Pagini recente » Cod sursa (job #147028) | Cod sursa (job #108330) | Cod sursa (job #1554585) | Cod sursa (job #125400) | Cod sursa (job #2432866)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
const int dim = 260;
const int dim2 = dim*(dim-1)/2;
const int mod = 194767;
int n,s,dp[2][dim2];
int main()
{
int i,j,val,val2;
in >> n >> s;
s = abs(s);
if (s > n*(n-1)/2)
{
out << "0";
return 0;
}
dp[1][0] = 1;
for (i=2; i<=n; i++)
{
for (j=0; j<=i*(i-1)/2; j++)
{
dp[i&1][j] = (dp[1-(i&1)][abs(j-i+1)]%mod + dp[1 - (i&1)][min(j+i-1 , dim*(dim-1)/2-1)]%mod)%mod;
}
}
out << dp[n&1][s];
return 0;
}