Cod sursa(job #1693519)
Utilizator | Data | 23 aprilie 2016 12:11:39 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
# include <bits/stdc++.h>
# define mod 194767
using namespace std;
ifstream fi("1-sir.in");
ofstream fo("1-sir.out");
const int nmax = 100005;
int dp[2][nmax];
int main(void)
{
int n,s;
fi>>n>>s;
int ok = 0;
dp[0][0] = 1;
for (int i = 2;i <= n;++i)
{
ok = 1 - ok;
int mx = i * (i + 1)/2;
for (int j = 0;j <= mx;++j) dp[ok][j] = (dp[!ok][abs(j + i - 1)] + dp[!ok][abs(j - i + 1)]) % mod;
}
return fo << dp[ok][abs(s)] << '\n',0;
}