Beecrowd-Problem-Solve/1024.cpp at main · FahimFBA/Beecrowd-Problem-Solve · 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
#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

int main()

{

    int n, size;

    string s;

    cin >> n;

    for (int i = 0; i <= n; ++i)

    {

        getline(cin, s);

        if (i == 0)

            continue;

        size = s.length();

        vector<char> v(size);

        for (int j = 0; j < size; ++j)
        {
            v[j] = s[j];
        }

        for (int j = 0; j < size; ++j)

        {

            if ((v[j] >= 'a' && v[j] <= 'z') || (v[j] >= 'A' && v[j] <= 'Z'))

                v[j] = v[j] + 3;
        }

        reverse(v.begin(), v.begin() + size);

        for (int j = (size / 2); j < size; ++j)

        {

            //if(v[j] != ' ')

            v[j] = v[j] - 1;
        }

        for (int j = 0; j < (size / 2); ++j)
        {
            cout << v[j];
        }

        for (int j = (size / 2); j < size; ++j)
        {

            //if(v[j] != ' ')

            cout << v[j];
        }

        cout << endl;
    }

    return 0;
}