Pagini recente » Cod sursa (job #316057) | Cod sursa (job #530342) | Cod sursa (job #1763187) | Cod sursa (job #3145722) | Cod sursa (job #2854722)
#include <fstream>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
const int MOD = 194767;
int dp[2][1 << 16];
int main ()
{
int n, s, last, sum, indice;
f >> n >> s;
s = abs (s);
if (s > n * (n - 1) / 2)
{
g << 0;
return 0;
}
dp[1][0] = 1, indice = 00;
for (last = 1; last < n; last += 1, indice ^= 1)
{
for (sum = 0; sum <= last * (last + 1) / 2; sum += 1)
dp[indice][sum] = (dp[indice ^ 1][abs (sum + last)] + dp[indice ^ 1][abs (sum - last)]) % MOD;
}
g << dp[indice ^ 1][s];
return 0;
}