#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
int factorial(int num)
{
return num == 1 ? 1 : num * factorial(num - 1);
}
int main()
{
int wordlength;
scanf("%d\n", &wordlength);
char* letters = (char*)malloc(sizeof(char) * (wordlength + 1));
scanf("%s", letters);
//fputs(letters, stdout);
int db = 0;
for (int i = 0; i < wordlength; i++)
{
if (letters[i] == '_')
{
db++;
}
}
int sol = 1;
for (int i = 26 - wordlength + 1; i <= 26 - (wordlength - db); i++) {
sol *= i;
}
printf("%d", sol);
free(letters);
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Wrong answer | 3ms | 1164 KiB | ||||
2 | Wrong answer | 2ms | 1428 KiB | ||||
subtask2 | 0/10 | ||||||
3 | Wrong answer | 2ms | 1696 KiB | ||||
4 | Wrong answer | 2ms | 2176 KiB | ||||
5 | Wrong answer | 2ms | 2140 KiB | ||||
subtask3 | 0/20 | ||||||
6 | Wrong answer | 2ms | 2048 KiB | ||||
7 | Wrong answer | 2ms | 2148 KiB | ||||
8 | Wrong answer | 2ms | 2184 KiB | ||||
9 | Wrong answer | 2ms | 2244 KiB | ||||
10 | Wrong answer | 2ms | 2500 KiB | ||||
11 | Wrong answer | 2ms | 2632 KiB | ||||
subtask4 | 0/30 | ||||||
12 | Wrong answer | 2ms | 2608 KiB | ||||
13 | Wrong answer | 2ms | 2880 KiB | ||||
14 | Wrong answer | 2ms | 3084 KiB | ||||
15 | Wrong answer | 2ms | 3108 KiB | ||||
16 | Wrong answer | 2ms | 3336 KiB | ||||
17 | Wrong answer | 2ms | 3180 KiB | ||||
subtask5 | 0/40 | ||||||
18 | Wrong answer | 2ms | 3112 KiB | ||||
19 | Wrong answer | 2ms | 3128 KiB | ||||
20 | Wrong answer | 2ms | 3360 KiB | ||||
21 | Wrong answer | 2ms | 3340 KiB | ||||
22 | Wrong answer | 2ms | 3404 KiB | ||||
23 | Wrong answer | 2ms | 3636 KiB | ||||
24 | Wrong answer | 2ms | 3436 KiB |