Pagini recente » Cod sursa (job #3305800) | Cod sursa (job #3326818) | Cod sursa (job #3325730) | Cod sursa (job #3321593) | Cod sursa (job #3327774)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("expresii2.in");
ofstream fout("expresii2.out");
int n, k, p, i, j, sum, d[102][102];
int main() {
ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> k >> p;
d[0][0] = 1;
for(i = 0; i < n; i++) {
for(j = 0; j <= i + 1; j++) {
if(i > 0 && j == 0) continue;
if(j > 0) d[i + 1][j - 1] += k * d[i][j];
if(i < n - 1) {
//d[i][j] += d[i - 1][max(0, j - 1)];
if(j > 0) d[i + 1][j ] += d[i][j];
else d[i + 1][j + 1] += d[i][j];
}
if(j > 0) d[i + 1][j + 1] += 2 * d[i][j];
else d[i + 1][j + 2] += 2 * d[i][j];
}
}
fout << d[n][0] << "\n";
return 0;
}