[백준 알고리즘] 2577번 숫자의 개수(Python 3, Java)

<Python 3>

a = int(input())
b = int(input())
c = int(input())
list = [0 for _ in range(10)]
mul = str(a * b * c)


for i in range(len(mul)):
    list[int(mul[i])] += 1

for i in list:
    print(i)

 

<Java>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int a = Integer.parseInt(br.readLine());
        int b = Integer.parseInt(br.readLine());
        int c = Integer.parseInt(br.readLine());
        int result = a*b*c;
        int[] count = new int[10];

        while(result>0){
            count[result%10]++;
            result/=10;
        }
        for(int num : count)
            System.out.println(num);
    }
}

 

▼링크

https://www.acmicpc.net/problem/2577

2577번: 숫자의 개수