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

using namespace std;

int main()
{
    int casesCount, mobileCount, dif;
    vector<string> mobileNumbers;
    string jalilNumber;

    scanf("%d", &casesCount);

    for (int caseId = 1; caseId <= casesCount; ++caseId)
    {
        scanf("%d", &mobileCount);
        printf("Case %d:\n", caseId);
        mobileNumbers = vector<string>(mobileCount);

        for (int i = 0; i < mobileCount; ++i)
        {
            cin >> mobileNumbers[i];
        }

        cin >> jalilNumber;

        for (auto &currentNumber : mobileNumbers)
        {
            dif = 0;
            for (int i = 0; i < currentNumber.size(); ++i)
            {
                if (currentNumber[i] != jalilNumber[i])
                {
                    ++dif;
                }
            }

            if (dif <= 1)
            {
                printf("%s\n", currentNumber.c_str());
            }
        }
    }

    return 0;
}