Pagini recente » Cod sursa (job #742177) | Cod sursa (job #1970678) | Cod sursa (job #2896862) | Cod sursa (job #2122210) | Cod sursa (job #905441)
Cod sursa(job #905441)
#include <iostream>
#include <fstream>
#include <cstdlib>
#define DN 260
#define MOD 194767
using namespace std;
int dp[4][DN*DN];
int main()
{
int n;
long long s;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
f>>n>>s;
if(s<0)
s=-s;
int smax=n*(n-1)/2;
if(s>n*(n-1)/2)
{
g<<0;
return 0;
}
bool p=1;
dp[1][0]=1;
for(int i=2;i<=n;++i)
{
for(int sum=0;sum<=smax;++sum)
{
dp[!p][sum]=dp[p][sum+i-1]+dp[p][abs(sum-i+1)];
if(dp[!p][sum]>=MOD)
dp[!p][sum]-=MOD;
}
p=!p;
}
g<<dp[p][s];
return 0;
}