Pagini recente » Clasament pregatireoji-lensumin120pct2 | Arhiva de probleme | Cod sursa (job #2072272) | Cod sursa (job #758434) | Cod sursa (job #2183692)
#include <fstream>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m,i,j,sum,k,sol[1001]['z'+1];
char x,y;
bool v['z'+1]['z'+1];
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
v[x][y]=1;
v[y][x]=1;
}
for(i='a';i<='z';i++)
sol[1][i]=1;
for(i=2;i<=n;i++)
for(j='a';j<='z';j++)
for(k='a';k<='z';k++)
if(v[k][j]==0)
sol[i][j]=(sol[i][j]+sol[i-1][k])%104659;
sum=0;
for(i='a';i<='z';i++)
sum=(sum+sol[n][i])%104659;
fout<<sum;
return 0;
}