Pagini recente » Cod sursa (job #679985) | Cod sursa (job #201185) | Cod sursa (job #111449) | Cod sursa (job #844590) | Cod sursa (job #2453852)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("nrcuv.in");
ofstream g ("nrcuv.out");
int nope[30][30];
int mak[1002][30];
int m,n;
int s=0;
int main()
{
f>>n>>m;
for(int i=1;i<=m;++i)
{
char x,y;
f>>x>>y;
nope[x-'a'+1][y-'a'+1]=1;
nope[y-'a'+1][x-'a'+1]=1;
}
for(int i=1;i<=26;++i)
{
mak[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(nope[j][k]==0)
{
mak[i][j]+=mak[i-1][k];
mak[i][j]%=104659;
}
}
}
}
for(int i=1;i<=26;++i)
{
s+=mak[n][i];
s%=104659;
}
g<<s;
return 0;
}