Cod sursa(job #1867994)

Utilizator herbertoHerbert Mohanu herberto Data 4 februarie 2017 14:51:58
Problema Lista lui Andrei Scor 5
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#include<stdio.h>
using namespace std;
#define MOD 104659
#define MAXN 1001

long long d[27][MAXN];
int ok[27][27];
int main(){
  FILE*fin=fopen("nrcuv.in", "r");
  FILE*fout=fopen("nrcuv.out", "w");
  int n, m, i, j, k;
  long long s;
  char c1, c2;
  fscanf(fin, "%d%d", &n, &m);
  for(j=1; j<=26; j++)
    d[1][j]=1;
  for(i=1; i<=26; i++)
    for(j=1; j<=26; j++)
      ok[i][j]=1;
  for(i=1; i<=m; i++){
    fscanf(fin, "%c %c\n", &c1, &c2);
    ok[c1-'a'+1][c2-'a'+1]=0;
    ok[c2-'a'+1][c1-'a'+1]=0;
  }
//  for(i=1; i<=26; i++)
//    printf("%c %d\n", i+'a'-1, deac[i]);
  for(i=2; i<=n; i++)
    for(j=1; j<=26; j++)
      for(k=1; k<=26; k++)
        if(ok[j][k]==1)
          d[i][j]=(d[i][j]+d[i-1][k])%MOD;
  s=0;
  for(j=1; j<=26; j++)
    s+=d[n][j];
  fprintf(fout, "%lld", s);
  return 0;
}