Cod sursa(job #1535606)
| Utilizator | Data | 24 noiembrie 2015 23:02:37 | |
|---|---|---|---|
| Problema | Lista lui Andrei | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <stdio.h>
#define mod 104659
using namespace std;
int reg[128][128];
int v[1001][26];
int main()
{
freopen("nrcuv.in","r",stdin);
freopen("nrcuv.out","w",stdout);
int n,m,i,j,t;
char x,y;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
scanf("\n%c %c",&x,&y);
reg[x][y]++;
reg[y][x]++;
}
for(i=0;i<26;i++)
v[1][i]=26;
for(i=2;i<=n;i++)
for(j=0;j<26;j++)
for(t=0;t<26;t++)
{
if(reg[j][t]==0&®[t][j]==0) v[i][j]=(v[i][j]+v[i-1][t])%mod;
}
printf("%d",v[n][0]);
return 0;
}
