Submission

PPPPPPPPPPPPPPPPPPPP

Score: 100

User: Namkhing

Problemset: Abacus

Language: cpp

Time: 0.003 second

Submitted On: 2025-04-10 20:44:59

#include <bits/stdc++.h>
using namespace std;

const int N = 8;
bool f[N];

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> v;
    while (n > 0) {
        v.push_back(n % 10);
        n /= 10;
    }
    while (v.size() < N) v.push_back(0);
    reverse(v.begin(), v.end());
    for (int i = 0; i < N; i++) {
        if (v[i] < 5) continue;
        v[i] -= 5;
        f[i] = 1;
    }
    for (int i = 0; i < N; i++) cout << "* "; cout << "\n";
    for (int i = 0; i < N; i++) {
        if (f[i]) cout << " ";
        else cout << "*";
        cout << " ";
    }
    cout << "\n";
    for (int i = 0; i < N; i++) {
        if (!f[i]) cout << " ";
        else cout << "*";
        cout << " ";
    }
    cout << "\n";
    for (int i = 0; i < 17; i++) cout << "-"; cout << "\n";
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < N; j++) {
            if (v[j] == i) cout << " ";
            else cout << "*";
            cout << " ";
        }
        cout << "\n";
    }
}