๐ ์ฝ๋ฉํ
์คํธ/๋ฐฑ์ค & ํ๋ก๊ทธ๋๋จธ์ค
[SWEA][JAVA]D2 : ์๋ก์ด ๋ถ๋ฉด์ฆ ์น๋ฃ๋ฒ
deep_lee
2022. 11. 19. 16:53
SW Expert Academy
SW ํ๋ก๊ทธ๋๋ฐ ์ญ๋ ๊ฐํ์ ๋์์ด ๋๋ ๋ค์ํ ํ์ต ์ปจํ ์ธ ๋ฅผ ํ์ธํ์ธ์!
swexpertacademy.com
๋น ๋ฌธ์์ด answer์ ํด๋น ์ซ์๊ฐ ์์ผ๋ฉด ์ถ๊ฐํ๋ฉด์, answer์ ๊ธธ์ด๊ฐ 10์ด ๋๋ฉด ์ข ๋ฃ.
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int T = kb.nextInt();
for (int t = 1; t <= T; t++) {
int n=kb.nextInt();
int temp=n;
String answer="";
while(answer.length()!=10){
String s=String.valueOf(n);
String[] arr=s.split("");
for(int i=0; i<arr.length; i++){
if(!answer.contains(arr[i])) {
answer += arr[i];
if(answer.length()==10)
break;
}
if(answer.length()==10)
break;
else
n+=temp;
}
System.out.println("#"+t+" "+n);
}
}
}