SWEA D2 1926 간단한 369

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV5PTeo6AHUDFAUq&categoryId=AV5PTeo6AHUDFAUq&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=JAVA&select-1=2&pageSize=10&pageIndex=1

SW Expert Academy

 

1 2 - 4 5 - 7 8 -  형태로 369를 -로 치환해서 출력하는 문제

33은 --, 333은 --- 이 된다

#include <iostream>
#include <vector>
using namespace std;


int main () {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        int cnt = 0;
        int original = i;
        while(original > 0){
            int tmp = original % 10;
            if(tmp == 3 || tmp == 6 || tmp == 9){
                cnt++;
            }
            original /= 10;
        }
        if(cnt == 0) cout << i << " ";
        else {
            while(cnt--> 0){
                cout <<"-";
            }
            cout << " ";
        }
    }
    return 0;
}