Не понимаю где ошибка.
Занимаюсь в целом программированием 3 недели (как хобби)
Проверял на исходном примере и на примерах, которые нашел на форуме. Ответы верны. Сюда загружаю выдаёт ошибку.

example = {'i' : 1, 'j' : 1, 'a' : 2, 'b' : 2, 'c' : 2,
               'd' : 3, 'e' : 3, 'f' : 3, 'g' : 4, 'h' : 4,
               'k' : 5, 'l' : 5, 'm' : 6, 'n' : 6, 'p' : 7,
               'r' : 7, 's' : 7, 't' : 8, 'u' : 8, 'v' : 8,
               'w' : 9, 'x' : 9, 'y' : 9, 'o' : 0, 'q' : 0, 'z' : 0}

while True:
    number = input()
    if int(number) == -1:
        break

    num_words = int(input())
    words = {}
    k = 500

    for i in range(num_words):
        word = input()
        if len(word) < k:
            k = len(word)
        key_word = ""
        for a in word:
            key_word += str(example.get(a))
        words[int(key_word)] = word

    answer = []
    loser = ""

    while True:
        copy = number[len("".join(answer)):]
        x = len(copy)
        while x >= k:
            if int(copy[:x]) in words.keys():
                if words[int(copy[:x])] != loser:
                    answer.append(words[int(copy[:x])])
                    copy = copy[x:]
                    x = len(copy) + 1
            x -= 1
        if len(answer) == 0:
            break
        elif len("".join(answer)) != len(number):
            loser = answer.pop()
        elif len("".join(answer)) == len(number):
            break

    if len(answer) == 0:
        print("No solution.")
    else:
        ans = " ".join(answer)
        print(ans)

Ребята, если не сложно, подскажите, почему здесь используем именно Console.In.ReadToEnd() вместо привычного Console.ReadLine() ?

Edited by author 26.01.2017 19:15

Edited by author 04.03.2017 21:51

Plesae! Give me some tests for check my program.

#include<iostream>
using namespace std;
int main()
{
    int CityCount, RoutesCount;

    cin >> CityCount;
    int *Road = new int[(CityCount - 1)*2];
    //Roads
    for (int i = 0; i < (CityCount - 1)*2; i++)
    {
        cin >> Road[i];
    }

    cin >> RoutesCount;
    int *Route = new int[RoutesCount*2];
    //Routes
    for (int i = 0; i < RoutesCount*2; i++)
    {
        cin >> Route[i];
    }
    //Road Matrix
    int j = 0;
    int **RMatrix= new int*[CityCount];
    for (int i = 0; i < CityCount; i++)
    {
        int *LineofMatrix = new int[CityCount];
        for (int i = 0; i < (CityCount - 1) * 2; i += 2)
        {
            if (Road[i] == j + 1)
                LineofMatrix[Road[i + 1] - 1] = 1;
            if (Road[i + 1] == j + 1)
                LineofMatrix[Road[i] - 1] = 1;
        }
        j++;
        RMatrix[i] = LineofMatrix;
    }
    //Output Road Matrix
    /*
    cout << endl;
    for (int i = 0; i < CityCount; i++)
    {
        for (int j = 0; j < CityCount; j++)
            if (RMatrix[i][j]>0)
                cout << RMatrix[i][j] << ' ';
            else
            {
                RMatrix[i][j] = 0;
                cout << 0 << ' ';
            }

        cout << endl;
    }
    cout << endl;
    */
    // alghoritm
    int *Value = new int[CityCount];
    int Vl = 0;
    int *Locked = new int[CityCount];
    int Lock = 0;
    bool BLock = false;

    int Bu = 0;
    int Final;
    int Cur;
    int PreCur=-1;
    int Iter=0;
    int min = INT_MAX;
    for (int i = 0; i < RoutesCount * 2; i+=2)
    {
        int *Buff = new int[CityCount * 2];
        Cur = Route[i] - 1;
        Final = Route[i + 1] - 1;
        Buff[Bu++] = Cur;
        Buff[Bu++] = Final;
        if (RMatrix[Cur][Final] == 1)
        {
            goto fin;
        }
        else
        {
            for (int j = 0; j < CityCount; j++)
            {
                if ((RMatrix[Cur][j] == 1) && (j != PreCur))
                {
                    PreCur = Cur;
                    Buff[Bu++] = j;
                    Iter++;
                    Cur = j;
                    j = -1;
                }
                if (RMatrix[Cur][Final] == 1)
                {
                    goto fin;
                }
                if (j == CityCount - 1)
                {
                    j = Cur;
                    Cur = PreCur;
                    Bu -= Iter;
                    Iter = 0;
                }
            }
        }
        fin:
        for (int z = 0; z < Bu; z++)
        {
            if (min > Buff[z])
            {
                min = Buff[z];
            }
        }
        Bu = 0;
        Iter = 0;
        cout << min+1 << endl;
        min = INT_MAX;
        delete[] Buff;
    }




    //system("pause");
    return 0;
}

Edited by author 08.03.2017 14:32

oh yeah,  nearly 1000 submits, i dont remember

Edited by author 05.03.2017 21:25

#include "iostream"

using namespace std;
int main()
{
    int a, b, rz;
    cin >> a >> b;
    if (b == 2 && a != 1 || b == 1 && a != 1) {
        rz = 2 * a / b;
    }
    else {
        if (a % b != 0) {
            rz = 2 * (a / b + 1);
        }
        else {
            rz = 2 * a / b;
        }
    }
    cout << rz;
    return 0;
}

i tested it a lot, pleas help may be i am so silly....

Hello)
I can't understand how to work with n = 2^1 000 000, cause it's very big number. I think, this problem can be solved at stage of converting entered number, but don't know exactly how)

Problem had tied on the fact that i used tokeniser for numbers and buffered reader for strings,
Now i'm using bf reader for both strings and numbers and it gets AC.

I leave it here, maybe it will useful

Edited by author 05.03.2017 01:23

I checked everything 100 times but still can not understand what the problem is.(i wrote on Java)

???

Could someone provide a case which would help me identify the bug?
code link-http://paste.ubuntu.com/24089865/

Edited by author 01.03.2017 18:10

public class Pan {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();

        int m = 2*n;
        if (m%k == 0){
            System.out.println(m/k);
        }
        else{

            System.out.println(m/k+1);
        }
    }
}
why Wrong Answer?

Is test #6 checking something interesting, or is it just precision-test?
At least, which solid is used in this test?

RT

1. Segment tree.
2. Fenwick tree.
3. Partial sums (b[i] = SUM(a[0], ..., a[i])).
4. Sqrt decomposition.
Hope, it helps to understand how to solve this task.

Edited by author 28.02.2017 15:25

1. Modification of a deque, which allows to find a min element in O(1).
2. Segment tree.
3. Min/max heap (was too slow for me).
4. Sparse table.
5. Sqrt decomposition.
Hope, it helps to understand how to solve this task.

Edited by author 28.02.2017 15:25