Cod sursa(job #1790863)
Utilizator | Data | 28 octombrie 2016 19:54:42 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int n, s, G, dp[33333];
int main()
{
fin >> n >> s;
dp[0] = 1;
if(s < 0)
s *= -1;
for(int i = 1; i < n; ++i)
for(int j = i*(i+1)/2; j >= i; --j)
dp[j] = (dp[j] + dp[j-i])%194767;
if(s > n*(n-1)/2)
fout << "0";
else
fout << dp[(n*(n-1)/2-s)/2];
return 0;
}