Cod sursa(job #2114679)

Utilizator aianisAndra Dumitru aianis Data 25 ianuarie 2018 19:02:37
Problema Lista lui Andrei Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.87 kb
#include <iostream>
#include <fstream>

using namespace std;

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

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

int main()
{
    int i, j, k, nr=0;
    char c1, c2;
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>c1>>c2;
        b[c1-'a'][c2-'a']= b[c2-'a'][c1-'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(j=0; j<26; j++)
    {
        //out << dp[n][j] << " ";
        nr += dp[n][j];
        nr %= MOD;
    }
    out<<nr;
    return 0;
}