Pagini recente » Cod sursa (job #503027) | Cod sursa (job #2712677) | Cod sursa (job #30908) | Cod sursa (job #1791100) | Cod sursa (job #1832759)
#include <fstream>
using namespace std;
int l[27][27],s[1001][27];
long long sum;
int main()
{
ifstream f("nrcuv.in");
ofstream h("nrcuv.out");
int n,i,j,k,m;
char x,y;
f>>n>>m>>ws;
for(i=1;i<=m;i++){
f>>x>>ws>>y>>ws;
l[x-'a'+1][y-'a'+1]=1;
l[y-'a'+1][x-'a'+1]=1;
}
for(i=1;i<=26;i++)
s[1][i]=1;
for(k=2;k<=n;k++)
for(i=1;i<=26;i++)
for(j=1;j<=26;j++){
if(!l[i][j])s[k][i]+=s[k-1][j]%104659;
}
for(i=1;i<=26;i++){
sum+=s[n][i]%104659;
sum=sum;
}
h<<sum%104659;
return 0;
}