Przejdź do treści

C++ - rozwiązanie

 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
#include <cstdio>
#include <iostream>
#include <map>

using namespace std;

void computeWordsIndexes(string txt, int counter, char letter, int &currentWordIndex, map<string, int> &wordToIndex)
{
    if (letter > 'z')
    {
        return;
    }

    string word;

    if (counter == 1)
    {
        for (char c = letter; c <= 'z'; ++c)
        {
            word = txt + c;
            wordToIndex[word] = currentWordIndex;
            currentWordIndex++;
        }

        return;
    }

    for (char c = letter; c <= 'z'; ++c)
    {
        word = txt + c;
        computeWordsIndexes(word, counter - 1, c + 1, currentWordIndex, wordToIndex);
    }
}

int main()
{
    int currentWordIndex = 1;
    string str;
    map<string, int> wordToIndex;

    for (int i = 1; i <= 5; ++i)
    {
        computeWordsIndexes("", i, 'a', currentWordIndex, wordToIndex);
    }

    while (cin >> str && !cin.eof())
    {
        printf("%d\n", wordToIndex[str]);
    }

    return 0;
}