Cod sursa(job #3316173)

Utilizator rapidu36Victor Manz rapidu36 Data 17 octombrie 2025 17:30:08
Problema Lista lui Andrei Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.24 kb
#include <fstream>

using namespace std;

const int N = 1000;
const int NL = 26;
const int MOD = 104659;

int nrc[2][NL];
bool inc[NL][NL];

int main()
{
    ifstream in("nrcuv.in");
    ofstream out("nrcuv.out");
    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        char c1, c2;
        in >> c1 >> c2;
        inc[c1-'a'][c2-'a'] = inc[c2-'a'][c1-'a'] = true;
    }
    for (int j = 0; j < NL; j++)
    {
        nrc[1][j] = 1;
    }
    for (int i = 2; i <= n; i++)
    {
        int i_c = i % 2;
        int i_a = 1 - i_c;
        for (int j = 0; j < NL; j++)
        {
            nrc[i_c][j] = 0;
            for (int k = 0; k < NL; k++)
            {
                if (!inc[k][j])
                {
                    nrc[i_c][j] += nrc[i_a][k];
                    if (nrc[i_c][j] >= MOD)
                    {
                        nrc[i_c][j] -= MOD;
                    }
                }
            }
        }
    }
    int rez = 0, n_c = n % 2;
    for (int j = 0; j < NL; j++)
    {
        rez += nrc[n_c][j];
        if (rez >= MOD)
        {
            rez -= MOD;
        }
    }
    out << rez << "\n";
    in.close();
    out.close();
    return 0;
}