Submission

Score: 100

User: cottory

Problemset: Abacus

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-07 11:37:11

#include <bits/stdc++.h>

using namespace std ;

int main(){
    int num ;
    cin >> num ;
    int abacus[16] ;
    for (int i = 0; i < 8; i++) {
        int val ;
        val = (num % 10) / 5 ;
        abacus[2*i] = val ;
        val = (num % 10) % 5 ;
        abacus[(2*i) + 1] = val ;
        num /= 10 ;
    }
    //line 1
    cout << "* * * * * * * *" << endl ;
    //line 2
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i] == 0) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 3
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i] == 1) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 4
    cout << "-----------------" << endl ;
    //line 5
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i + 1] > 0) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 6
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i + 1] > 1 || abacus[2*i + 1] <= 0) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 7
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i + 1] > 2 || abacus[2*i + 1] <= 1 ) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 8
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i + 1] > 3 || abacus[2*i + 1] <= 2) {
            cout << "* " ;
        }
        else {
            cout << "  " ;
        }
    }
    cout << endl ;
    //line 9
    for (int i = 7; i >= 0; i--) {
        if (abacus[2*i + 1] > 3) {
            cout << "  " ;
        }
        else {
            cout << "* " ;
        }
    }
    cout << endl ;
    //line 10
    cout << "* * * * * * * *" << endl ;

    return 0 ;
}