Cod sursa(job #3209278)

Utilizator VanillaSoltan Marian Vanilla Data 2 martie 2024 11:22:08
Problema Lista lui Andrei Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.97 kb
#include <bits/stdc++.h>
using namespace std;
string __fname = "nrcuv"; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
#define cin in 
#define cout out
const int maxn = 1e3 + 2;
const int mod = 104659;
int a[26][26]; // a[i][j] = 1 daca nu pot pune literele i si j una langa alta
int dp[maxn][26]; // dp[i][j] -> numarul de stringuri de i caractere, ultimul caracter fiind j

int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10);
  int n,m;
  cin >> n >> m;
  for (int i = 0; i < m; i++){
    char x,y;
    cin >> x >> y;
    a[x - 'a'][y - 'a'] = a[y - 'a'][x - 'a'] = 1;
  }
  for (int i = 0; i < 26; i++){
    dp[1][i] = 1;
  }
  for (int i = 2; i <= n; i++){
    for (int last = 0; last < 26; last++){
      for (int prev = 0; prev < 26; prev++){
        if (!a[prev][last]) (dp[i][last]+=dp[i-1][prev])%=mod;
      }
    }
  }
  int sum = 0;
  for (int i = 0; i < 26; i++){
    (sum+=dp[n][i])%=mod;
  }
  cout << sum;
  return 0;
}