Pagini recente » Cod sursa (job #1384131) | Cod sursa (job #2328101) | Cod sursa (job #162861) | Cod sursa (job #2040634) | Cod sursa (job #1903128)
#include <fstream>
#define mod 104659
using namespace std;
ifstream fin ("nrcuv.in");
ofstream fout ("nrcuv.out");
bool interzis[30][30];
int v[1002][30];
int main (){
for (int i = 1; i <= 26; ++i)
v[1][i] = 1;
int n,m;
char x,y;
fin >> n >> m;
for (int i = 1; i <= m; ++i){
fin >> x >> y;
interzis[x-'`'][y-'`'] = 1;
interzis[y-'`'][x-'`'] = 1;
}
for (int i = 2; i <= n; ++i){
for (int j = 1; j <= 26; ++j)
for (int k = 1; k <= 26; ++k)
if (!interzis[j][k] && !interzis[k][j])
v[i][j] = (v[i][j] + v[i-1][k])%mod;
}
int sumfinal = 0;
for (int i = 1; i <= 26; ++i)
sumfinal = (sumfinal + v[n][i])%mod;
fout << sumfinal;
}
/// ``````````````````````````````