Cod sursa(job #2704267)
Utilizator | Florea Alina AlinaFlorea | Data | 10 februarie 2021 09:15:39 |
---|---|---|---|
Problema | Lista lui Andrei | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <bits/stdc++.h>
#define MOD 104659
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
int n, m, a[30][30], b[2005][2005];
long long key;
int main()
{
f>>n>>m;
for(int i=1; i<=m; i++){
char x,y;
f>>x>>y;
a[x-'a'][y-'a']=1;
a[y-'a'][x-'a']=1;
}
for(int i=0; i<26; i++)
b[1][i]=1;
for(int i=2; i<=n; i++){
for(int j=0; j<26; j++){
for(int k=0; k<26; k++)
if(!a[j][k]){
b[i][j]+=b[i-1][k];
b[i][j]%=MOD;
}
}
}
for(int i=0; i<26; i++)
key+=b[n][i];
g<<key%MOD;
return 0;
}