프로그래밍/BOJ

백준 알고리즘 [2577번] (C++) 숫자의 개수

coty 2019. 7. 29. 13:51

 


Code

#include <iostream>
using namespace std;

void printintnum(int N);
int storeint[10] = { 0 };
int remain;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int A, B, C;
	int mul = 0;

	cin >> A >> B >> C;
	mul = A * B * C;

	printintnum(mul);

	for (int i = 0; i < 10; i++)
		cout << storeint[i] << "\n";
}
void printintnum(int N) {

	int div = N;

	for (;;) {
		remain = div % 10;
		storeint[remain]++;
		div /= 10;

		if (div == 0)
			break;
	}
}