Pagini recente » Cod sursa (job #1448513) | Cod sursa (job #1566676) | Cod sursa (job #1661004) | Cod sursa (job #2131498) | Cod sursa (job #2304774)
#include <fstream>
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
long long cont;
int sp[27][27];
bool perechi[27][27];
int main() {
int m, n;
f>>n>>m;
for(int i=1; i<=m; i++) {
char x,y;
f>>x>>y;
perechi[x-'a'+1][y-'a'+1]=true;
perechi[y-'a'+1][x-'a'+1]=true;
}
for(int i=1; i<=26; i++) {
sp[1][i]=1;
}
for(int i=2; i<=n; i++) {
for(int j=1; j<=26; j++) {
for(int k=1; k<=26; k++) {
if(perechi[k][j]==0) {
sp[i][j]=(sp[i][j]+sp[i-1][k])%104659;
}
}
}
}
for(int i=1; i<=26; i++) {
cont=(cont+sp[n][i])%104659;
}
g<<cont;
return 0;
}