Pagini recente » Cod sursa (job #243419) | Cod sursa (job #2275090) | Cod sursa (job #448539) | Cod sursa (job #2178151) | Cod sursa (job #69129)
Cod sursa(job #69129)
using namespace std;
#include <cstdio>
#define maxn 100
#define maxS (maxn*maxn/2)
#define mod 194767
#include <map>
int N, S;
map<int, map<int,int> > dp;
template <class T> T sgn(T a) { if(a>0) return a;return -a;}
int main()
{
freopen("1-sir.in","r",stdin);
scanf("%d %d\n", &N, &S);
dp[1][1]=1;
dp[1][-1]=1;
//S=sgn(S);
int i, j;
for(i=2;i<=N;++i)
for(j=0;j<=S;++j)
dp[i][j]=dp[i-1][j-(i-1)]+dp[i-1][j+(i-1)],
dp[i][j]%=mod;
/* for(i=0;i<=N;++i)
{
for(j=0;j<=S;++j) printf("%d ", dp[i][j]);
printf("\n");
}
*/
freopen("1-sir.out","w",stdout);
printf("%d\n", sgn(dp[N-1][S]));
return 0;
}