Nu aveti permisiuni pentru a descarca fisierul grader_test8.ok
Cod sursa(job #1539718)
Utilizator | Data | 1 decembrie 2015 14:51:37 | |
---|---|---|---|
Problema | Lista lui Andrei | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <fstream>
#define MOD 104659
#define N 1001
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int perechi[26][26];
int cuv[N][26], n, m;
int main()
{
char x, spatiu, y;
fin>>n>>m;
fin.get();
for(int i=1;i<=m;i++)
{
fin.get(x);
fin.get();
fin.get(y);
fin.get();
perechi[x-'a'][y-'a']=perechi[y-'a'][x-'a']=1;
}
for(int j=0;j<=25;j++)
cuv[1][j]=1;
for(int i=2;i<=n;i++)
{
for(int l1=0;l1<26;l1++)
for(int l2=0;l2<26;l2++)
if(!perechi[l1][l2])
cuv[i][l1]=(cuv[i][l1]+cuv[i-1][l2])%MOD;
}
int s=0;
for(int i=0;i<26;i++)
s=(s+cuv[n][i])%MOD;
fout<<s;
return 0;
}