#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 | 1348 KiB | ||||
| 2 | Wrong answer | 2ms | 1496 KiB | ||||
| subtask2 | 0/10 | ||||||
| 3 | Wrong answer | 2ms | 1692 KiB | ||||
| 4 | Wrong answer | 2ms | 2020 KiB | ||||
| 5 | Wrong answer | 2ms | 1992 KiB | ||||
| subtask3 | 0/20 | ||||||
| 6 | Wrong answer | 2ms | 2172 KiB | ||||
| 7 | Wrong answer | 2ms | 2192 KiB | ||||
| 8 | Wrong answer | 2ms | 2224 KiB | ||||
| 9 | Wrong answer | 2ms | 2524 KiB | ||||
| 10 | Wrong answer | 2ms | 2736 KiB | ||||
| 11 | Wrong answer | 2ms | 3064 KiB | ||||
| subtask4 | 0/30 | ||||||
| 12 | Wrong answer | 2ms | 2852 KiB | ||||
| 13 | Wrong answer | 2ms | 3092 KiB | ||||
| 14 | Wrong answer | 2ms | 3116 KiB | ||||
| 15 | Wrong answer | 2ms | 3000 KiB | ||||
| 16 | Wrong answer | 2ms | 3032 KiB | ||||
| 17 | Wrong answer | 2ms | 3264 KiB | ||||
| subtask5 | 0/40 | ||||||
| 18 | Wrong answer | 2ms | 3520 KiB | ||||
| 19 | Wrong answer | 2ms | 3280 KiB | ||||
| 20 | Wrong answer | 2ms | 3296 KiB | ||||
| 21 | Wrong answer | 2ms | 3296 KiB | ||||
| 22 | Wrong answer | 2ms | 3240 KiB | ||||
| 23 | Wrong answer | 2ms | 3512 KiB | ||||
| 24 | Wrong answer | 2ms | 3444 KiB | ||||