Pagini recente » Cod sursa (job #2184608) | Cod sursa (job #3249477) | Cod sursa (job #2353506) | Cod sursa (job #3216915) | Cod sursa (job #2326029)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
unsigned long long int N,M,i,j,a[1001][26],q,tot,k;
struct pereche{unsigned x; unsigned y;};
char c;
pereche v[1001];
int main()
{ f>>N>>M;
for(i=1;i<=M;i++)
{f>>c; v[i].x=c-'a'+1;
f>>c; v[i].y=c-'a'+1;
}
for(i=1;i<=26;i++)
a[1][i]=1;
for(i=2;i<=N;i++)
for(j=1;j<=26;j++)
{ for(q=1;q<=26;q++)
{ int ok=1;
for(k=1;k<=M;k++)
if((v[k].x==q&&v[k].y==j)||(v[k].x==j&&v[k].y==q)) ok=0;
if(ok!=0) a[i][j]=a[i][j]+a[i-1][q];
}
}
for(i=1;i<=26;i++)
tot=tot+a[N][i];
g<<tot%104659;
f.close();
return 0;
}