Pagini recente » Cod sursa (job #2079918) | Cod sursa (job #2524548) | Cod sursa (job #426488) | Cod sursa (job #119906) | Cod sursa (job #573238)
Cod sursa(job #573238)
#include<iostream.h>
#include<fstream.h>
int n,i,j,m,S[26][10000],A[26][26],l,sum;
char c1,c2;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
int main(){
f>>n>>m;
for (i=1;i<=m;i++){
f>>c1>>c2;
A[c1-'a'][c2-'a']=A[c2-'a'][c1-'a']=1;
}
for (i=0;i<=25;i++)
S[i][1]=1;
for (j=2;j<=n;j++)
for (i=0;i<=25;i++)
for ( l=0; l<=25; l++)
if ( A[i][l]==0){
S[i][j]+=S[l][j-1];
S[i][j]%=104659;
}
sum=0;
for (i=0;i<=25;i++){
sum+=S[i][n];
sum%=104659;
}
g<<sum;
f.close();
g.close();
return 0;
}