Pagini recente » Cod sursa (job #980792) | Cod sursa (job #1419716) | Cod sursa (job #676276) | Cod sursa (job #3264929) | Cod sursa (job #1022388)
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
#define MOD 104659
long long i,n,m,descos;
char l1,l2;
int pu(int n,int p)
{
int b=1;
while (p)
{
if ((p&1))
{
b=((b%MOD)*(n%MOD))%MOD;
p--;
}
n=((n%MOD)*(n%MOD))%MOD;
p=(p>>1);
}
return b;
}
int main()
{
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>l1>>l2;
if((int)l1-(int)l2 == -1 || (int)l1-(int)l2 == 1) descos+=2;
if((int)l1==(int)l2) descos+=1;
}
out << (pu(26,n)-descos)%MOD;
return 0;
}