Submission

Score: 100

User: pressoboi

Problemset: Abacus

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-02 23:43:26

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

int main(){
    int n;
    cin >> n;
    int top[9]={};
    int low[9]={};
    for(int i=8;i>=1;i--){
        if(n/(5*pow(10,i-1))!=0){
            top[i] += n/ (5*pow(10,i-1));
            n-=top[i]*(5*pow(10,i-1));
        }
        if(n/(pow(10,i-1))!=0){
            low[i]+=n/(pow(10,i-1));
            n-=low[i]*(pow(10,i-1));
        }
    }
    for(int i=8;i>=1;i--){
        if(top[i]==0||top[i]==1){
            cout << "* ";
        }else{
            cout << "  ";
        }
    }
    cout << '\n';
    for(int i=8;i>=1;i--){
        if(top[i]==0){
            cout << "* ";
        }else{
            cout << "  ";
        }
    }
    cout << '\n';
    for(int i=8;i>=1;i--){
        if(top[i]==1||top[i]==2){
            cout << "* ";
        }else{
            cout << "  ";
        }
    }
    for(int i=8;i>=1;i--){
        if(top[i]==2){
            cout << "* ";
        }else{
            cout << "  ";
        }
    }
    cout << '\n';
    cout <<"-----------------";
    cout << '\n';
    for(int i=8;i>=1;i--){
        if(low[i]!=0){
            cout << "* ";
        }else{
            cout << "  ";
        }
    }
    cout << '\n';
    for(int j=1;j<=5;j++){
        for(int i=8;i>=1;i--){
            if(low[i]!=j){
                cout << "* ";
            }else{
                cout << "  ";
            }
        }
        cout << '\n';
    }
    return 0;
}