Pagini recente » Cod sursa (job #3190403) | Cod sursa (job #2701078) | Cod sursa (job #2521656) | Cod sursa (job #1696405) | Cod sursa (job #2948181)
#include <fstream>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int *dp[2],aux[2][65840];
const int mod=194767;
int main()
{
int n,s;
fin>>n>>s;
dp[0]=aux[0]+n*(n-1)/2;
dp[1]=aux[1]+n*(n-1)/2;
dp[0][0]=1;
for(int i=1;i<n;i++)
{
int curr=i%2;
for(int j=0;j<65840;j++)
aux[curr][j]=0;
int l=i*(i+1)/2;
for(int j=-l;j<=l-i;j++)
dp[curr][j+i]=(dp[curr][j+i]+dp[1-curr][j])%mod;
for(int j=-l+i;j<=l;j++)
dp[curr][j-i]=(dp[curr][j-i]+dp[1-curr][j])%mod;
}
fout<<dp[1-n%2][s];
return 0;
}