Cod sursa(job #2680810)
Utilizator | Data | 4 decembrie 2020 14:03:00 | |
---|---|---|---|
Problema | 1-sir | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define MOD 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int N, S;
int dp[111][11111];
///dp[i][j] -> numarul de siruri de lungime i care au suma j
int main()
{
fin >> N >> S;
dp[1][0] = 1;
for(int i = 2; i <= N; i ++)
{
for(int j = 0; j <= i * (i-1) / 2; j ++)
{
dp[i][j]=dp[i-1][abs(j + (i-1))]+dp[i-1][abs(j -(i-1))];
dp[i][j] %= MOD;
}
}
fout << dp[N][S] << '\n';
}