Cod sursa(job #1821101)

Utilizator giotoPopescu Ioan gioto Data 2 decembrie 2016 17:06:49
Problema Lista lui Andrei Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.87 kb
#include <cstdio>
#define MOD 104659
using namespace std;

int n, m, x, y, v[1001][27];
char c1, c2;
bool f[27][27];
int main()
{
    freopen("nrcuv.in", "r", stdin);
    freopen("nrcuv.out", "w", stdout);
    scanf("%d%d\n", &n, &m);
    for(int i = 1; i <= m ; ++i){
        scanf("%c %c\n", &c1, &c2);
        x = c1 - 'a' + 1; y = c2 - 'a' + 1;
        if(f[x][y] == 1) continue ;
        f[x][y] = 1; f[y][x] = 1;
    }
    for(int i = 1; i <= 26 ; ++i)
        v[1][i] = 1;
    for(int i = 2; i <= n ; ++i){
        for(int j = 1; j <= 26 ; ++j){
            for(int t = 1; t <= 26 ; ++t){
                if(f[j][t] == 1) continue ;
                v[i][j] = (v[i][j] + v[i - 1][t]) % MOD;
            }
        }
    }
    int Sol = 0;
    for(int i = 1; i <= 26 ; ++i)
        Sol = (Sol + v[n][i]) % MOD;
    printf("%d", Sol);
    return 0;
}