Pagini recente » Cod sursa (job #1452961) | Cod sursa (job #538486) | Clasament simulare1_martie | Cod sursa (job #1429368) | Cod sursa (job #2413201)
#include <fstream>
using namespace std;
ifstream cin ("culori.in");
ofstream cout ("culori.out");
const int MOD = 9901;
int n;
int v[270], dp[270][270];
int main() {
cin >> n;
n *= 2; n--;
for(int i = 1; i <= n; i++)
cin >> v[i], dp[i][i] = 1;
for(int i = n - 1; i >= 1; i--) {
for(int j = i + 1; j <= n; j++) {
for(int k = i + 2; k <= j; k++) {
if(v[k] == v[i])
dp[i][j] = (dp[i][j] + dp[i + 1][k - 1] * dp[k][j]) % MOD;
}
}
}
cout << dp[1][n];
return 0;
}