Monistus

input/code.cpp: In function 'int main()':
input/code.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
input/code.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int i = 0; i < answer.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

bool if_num(int c) {
    if (1 <= c && c <= 9) {
        return true;
    }
    return false;
}

int main() {
    string s; cin >> s;
    vector<char> a(s.size());
    deque<char> q;
    for (int i = 0; i < s.size(); i++) {
        a[i] = (char) s[i];
        q.push_back(a[i]);
    }

    vector<char> answer;

    char ch; int x;
    while (q.size() > 0) {
        ch = q.front();
        q.pop_front();
        x = ch - '0';

        if (!if_num(x)) {
            answer.push_back(ch);
            continue;
        }

        vector<char> ad;
        for (int i = 0; i < x; i++) {
            ch = q.front();
            q.pop_front();
            ad.push_back(ch);
        }
        for (int i = x - 1; i >= 0; i--) {
            q.push_front(ad[i]);
        }
        for (int i = x - 1; i >= 0; i--) {
            q.push_front(ad[i]);
        }
    }

    /*int n; bool flag = true;
    while (flag) {
        flag = false;
        n = a.size();
        for (int i = 0; i < n; i++) {
            if (a[i] - '0' >= 1 && a[i] - '0' <= 9) {
                flag = true;
                int num = a[i] - '0';
                for (int j = 0; j < num; j++) {
                    a.push_back(' ');
                    for (int k = a.size() - 1; k > i; k--) {
                        a[k] = a[k - 1];
                    }
                }
                for (int k = i + 1; k <= i + num; k++) {
                    a[k] = a[k + num];
                }
                for (int k = i; k < a.size() - 1; k++) {
                    a[k] = a[k + 1];
                }
                a.pop_back();
                break;
            }
        }
    } */

    for (int i = 0; i < answer.size(); i++) {
        cout << answer[i];
    }
    /*cout << '\n';
    for (int i = 0; i < a.size(); i++) {
        cout << a[i];
    } */
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED