beecrowd-solutions/1255.c at main · Rottschaefer/beecrowd-solutions · GitHub

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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <stdio.h>

int str_len(char *word){

    int count = 0;

    for (int i = 0; i < i+1; i++)
    {
        if (*(word + i) == '\0'){
            break;
        }

        count++;
    }

    return count;

}

void get_most_frequent_letters(int*letters){

    int max = 0;
    for (int i = 0; i < 26; i++)
    {
        if(*(letters+i)>max){
            max = *(letters+i);
        }
    }

    int most_frequent[26];
    int j = 0;

    for (int i = 0; i < 26; i++)
    {
        if(*(letters+i)==max){
            printf("%c", i+'a');
        }
    }
}

int calc_letters(char *word){

    int letters[26] = {0};
    int base_letter = 'a';
    int letter;

    for (int i = 0; i < str_len(word); i++)
    {

        letter = *(word+i);

        if(letter <65 || (letter > 90 && letter<97) || letter>122){
            continue;
        }

        if(letter-'a' < 0){
            base_letter = 'A';
        }
        else{
            base_letter = 'a';
        }

        letters[letter-base_letter]++;

         }

    get_most_frequent_letters(letters);

    return 0;

}


int main(){


    char word[201];

    int n = 0;

    scanf("%d", &n);
    getchar();

    for (int i = 0; i < n; i++)
    {
        scanf("%201[^\n]", word);
        calc_letters(word);
        puts("");
        getchar();
    }

    return  0;
}