Cod sursa(job #1691947)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 19 aprilie 2016 20:42:25
Problema Lista lui Andrei Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.61 kb
#include<fstream>
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
const int mod=104659;
int n,m,s[30][30],bst[1005][30];
char a,b;
int main()
{
    f>>n>>m;
    while(m--)
    {
        f>>a>>b;
        s[a-'a'+1][b-'a'+1] = 1;
        s[b-'a'+1][a-'a'+1] = 1;
    }
    for(int i=1;i<=26;i++)
      bst[1][i]=1;
    for(int i=2;i<=n;i++)
      for(int j=1;j<=26;j++)
        for(int l=1;l<=26;l++)
          if(s[j][l]==0)
            bst[i][l]=(bst[i][l]+bst[i-1][j])%mod;
    int rez=0;
    for(int i=1;i<=26;i++)
      rez=(rez+bst[n][i])%mod;
    g<<rez;
    return 0;
}