ITMO N9 21-22_otbor

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

bool sh = 0;
int f(int M, int C) {
    int R = 0, N = 1, T = 0;
    while (M != 0) {
        T = 0;
        if (sh) {
            cout << "GO\n";
        }
        while (M >= C) {
            T++;
            M -= C;
        }
        R += M * N;
        N *= 10;
        M = T;
        if (sh) {
            cout << "R N M = " << R << ' ' << N << ' ' << M << ' ' << "\n";
        }
    }
    return R;
}


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    sh = 1;
    /*for (int i = 0; i < 1e5; ++i) {
        if (f(i, 8) == 30071) {
            cout << i << "\n";
        }
    }*/
    cout << f(12345, 8);
}