Pagini recente » Cod sursa (job #793078) | Cod sursa (job #2141475) | Cod sursa (job #2364967) | Cod sursa (job #1403094) | Cod sursa (job #604784)
Cod sursa(job #604784)
#include<fstream>
#define modulo 104659
using namespace std;
bool ind[27][27];
int n,m,nr,p,a[1001][27];
char ch1,ch2,aux;
int power26(int a){
int p=26;
for(int i=2;i<=a;++i)
p=(p*26)%modulo;
return p;
}
int main(void){
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
fin>>n>>m;
for(int l=1;l<=m;++l){
fin>>ch1>>ch2;
ind[ch1-96][ch2-96]=true;
ind[ch2-96][ch1-96]=true;
}
fin.close();
nr=0;
for(int j=1;j<=26;++j) a[1][j]=1;
for(int i=2;i<=n;++i){
nr=0;
for(int j=1;j<=26;++j){
for(int k=1;k<=26;++k)
if(!ind[k][j])
nr=(nr+a[i-1][k])%modulo;
a[i][j]=nr;
}
}
fout<<(nr)%modulo;
fout.close();
return 0;
}