blob: 243ea8cd74cce9d66c660a69bcce729eb4190539 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long *hist[26];
void res(char s0[],
int main()
{
short k;
char s[2000001], alpha;
long length, i, a[26] = {};
scanf("%hd", k);
scanf("%s", s);
length = strlen(s);
if (length > (k - 1) * 26) {
for (i = 0; i < length; i++) {
alpha = s[i] - 97;
a[alpha]++;
if (a[alpha] == k) {
short j;
for (j = 0; j < a[alpha]; j++)
printf("%c", alpha + 97);
printf("\n");
break;
}
}
} else {
hist = malloc(208 * length), tmp;
char map[26], j, chr2use = 0;
for (i = 0; i < length; i++) {
alpha = s[i] - 97;
hist[alpha][a[alpha]] = i;
a[alpha]++;
}
for (i = 0; i < 26; i++)
map[i] = i;
for (i = 0; i < 25; i++)
for (j = i; j < 26; j++)
if (a[j] > a[i]) {
tmp = map[i];
map[i] = map[j];
map[j] = tmp;
}
}
return 0;
}
|