Cod sursa(job #3191483)

Utilizator rapidu36Victor Manz rapidu36 Data 9 ianuarie 2024 19:51:37
Problema Lista lui Andrei Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.08 kb
#include <fstream>

using namespace std;

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

bool incomp[NL][NL];
int nr_c[N+1][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 x, y;
        in >> x >> y;
        int nr_ord_x = x - 'a';
        int nr_ord_y = y - 'a';
        incomp[nr_ord_x][nr_ord_y] = incomp[nr_ord_y][nr_ord_x] = true;
    }
    for (int j = 0; j < NL; j++)
    {
        nr_c[1][j] = 1;
    }
    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j < NL; j++)
        {
            for (int k = 0; k < NL; k++)
            {
                if (!incomp[j][k])
                {
                    nr_c[i][j] += nr_c[i-1][k];
                    nr_c[i][j] %= MOD;
                }
            }
        }
    }
    int rez = 0;
    for (int j = 0; j < NL; j++)
    {
        rez += nr_c[n][j];
        rez %= MOD;
    }
    out << rez << "\n";
    in.close();
    out.close();
    return 0;
}