Pagini recente » Cod sursa (job #2026255) | Cod sursa (job #2775864) | Cod sursa (job #158968) | Cod sursa (job #2425398) | Cod sursa (job #2192302)
#include <iostream>
#include <fstream>
#define mod 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int dp[3][66001],n,s,last[3][66001],nr;
int main()
{
dp[0][33000]=1;
f>>n>>s;
for(int i=2;i<=n;++i)
{
for(int j=1;j<66000;++j)
{
if(dp[0][j])
{
nr=last[0][j];
dp[1][j+nr+1]=(dp[1][j+nr+1]+dp[0][j])%mod; last[1][j+nr+1]=nr+1;
dp[1][j+nr-1]=(dp[1][j+nr-1]+dp[0][j])%mod; last[1][j+nr-1]=nr-1;
}
}
for(int j=1;j<66000;++j)
{
dp[0][j]=dp[1][j]; dp[1][j]=0;
last[0][j]=last[1][j]; last[1][j]=0;
}
}
if(s>=33000 || -s>=33000) g<<'0';
else g<<dp[0][s+33000];
return 0;
}