Submission

Score: 100

User: Kei

Problemset: Abacus

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-06 17:37:13

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

void solve(){
    int n,div;
    cin >> n;
    cout << "* * * * * * * *\n"; //This is the static first line
    vector<int> place(8);
    vector<bool> fivet(8);
    for(int i=7;i>=0;i--){
        place[i]=n%10;
        n/=10;
        if(place[i]>=5){
            place[i]-=5;
            fivet[i]=true;
        }
    }
    //print
    for(int i=0;i<8;i++){
        if(!fivet[i]) cout<<'*';
        else cout<<' ';
        if(i<7)cout<<' ';
        
    }
    cout<<'\n';
    for(int i=0;i<8;i++){
        if(fivet[i]) cout<<'*';
        else cout<<' ';
        if(i<7)cout<<' ';
    }
    cout<<"\n-----------------\n";
    for(int i=0;i<6;i++){
        for(int j=0;j<8;j++){
            if(place[j]==i)cout<<' ';
            else cout<<'*';

            if(j<7)cout<<' ';
        }
        cout<<'\n';
    }

}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}