Cod sursa(job #2114676)

Utilizator Remus12Remus Dan Remus12 Data 25 ianuarie 2018 18:59:41
Problema Lista lui Andrei Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.9 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream in("nrcuv.in");
ofstream out("nrcuv.out");

const int N = 1001;
const int MOD = 104659;
int dp[N][N],b[N][N];

int main()
{
    int n,m,k,i,j,S = 0;
    char x,y;
    in >> n >> m;
    for(i = 1;i <= m;i++){
        in >> x >>y;
        b[x - 'a'][y - 'a'] = b[y - 'a'][x - 'a'] = true;
    }
    for(j = 0; j < 26; j++)
        dp[1][j] = 1;
    for(i = 2; i <= n; i++)
        for(j = 0;j < 26;j++)
            for(k = 0;k < 26;k++){
                if(!b[k][j]){
                    dp[i][j] += dp[i-1][k];
                    dp[i][j] %= MOD;
                }
            }
    /*
    for(i = 1; i <= n; i++) {
        for (j = 0; j < 26; j++) {
            out << dp[i][j] << "\t";
        }
        out << "\n";
    }
    */
    for(j = 0 ; j <= 26 ;j++){
            S += dp[n][j];
            S %= MOD;
    }
    out << S;



    return 0;
}