SWEA 1288 새로운 불면증 치료법

1 개요

SSWEA 1288 새로운 불면증 치료법

SW Expert 아카데미

#	문제	풀이

2 C++

#include<iostream>
using namespace std;
int main(int argc, char** argv)
{
	int test_case;
	int T;
	cin >> T;
	for (test_case = 1; test_case <= T; ++test_case) {
		int arr[10] = { 0 };
		int answer = 0;
		int input;
		scanf("%d", &input);
		int N = input;
		for (int i = 0; ; i++) {
			int temp = N;
			while (N != 0) {
				arr[N % 10] = 1;
				N /= 10;
			}
			int count = 0;
			for (int j = 0; j<10; j++) {
				if (arr[j] == 1) count++;
			}
			if (count == 10) {
				answer = temp;
				break;
			}
			N = input * i;
		}
		printf("#%d %d\n", test_case, answer);
	}
	return 0;
}

3 Java

import java.util.*;
public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T;
		T=sc.nextInt();

		int N, i, cur, temp, q;
		Set<Integer> seen = new HashSet<Integer>();

		for(int test_case = 1; test_case <= T; test_case++) {
			N = sc.nextInt();
			seen.clear();
			for(i=1; ; i++) {
				cur = N*i;
				for(temp=cur; temp>0; temp/=10) {
					q = temp%10;
					seen.add(q);
				}
				if(seen.size()>9) break;
			}
			System.out.format("#%d %d\n", test_case, cur);
		}
		sc.close();
	}
}