Номера страниц

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);

int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    vector<ll>yl(10, 0);
    string n;
    cin >> n;
    for (int i = 0; i < n.size() - 1; i++)
    {
            if(i!=0)
                for (int j = 0; j < n[i] - '0'; j++)
                {
                    yl[j] += pow(10, n.size() - i - 1);
                }
            else
                for (int j = 1; j < n[i] - '0'; j++)
                {
                    yl[j] += pow(10, n.size() - i - 1);
                }
            ll sp = n[i] - '0';
            ll zd = pow(10, n.size() - i - 2);

            for (int j = i + 1; j < n.size(); j++)
            {
                for (int k = 0; k <= 9; k++)
                {
                    if (k == 0 && i == 0)
                    {
                        yl[k] += (sp-1)* zd;
                    }
                    else
                        yl[k] += sp * zd;
                }
                zd /= 10;
                sp *= 10;
                if (zd == 0)
                    zd = 1;

            }
            yl[n[i] - '0'] += atoi(n.substr(i + 1, n.size() - i - 1).c_str()) + 1;
    }
    for (int i = 0; i <= n[n.size() - 1]-'0'; i++)
        yl[i]++;
    if (n.size() == 1)
        yl[0]--;
    for (int i = 0; i <= 9; i++)
    {
        cout << yl[i] << endl;
    }
    return 0;
}