[Java/백준/브루트 포스] 2231 - 분해합

문제

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

2231번: 분해합

 

코드

import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int decomposition = in.nextInt();
		int size = String.valueOf(decomposition).length();
	
		for(int i=decomposition-(9*size); i<decomposition; i++) { //constructor i
			int tmpDecomposition = i;
			int tmp = i;
			while(tmp>0) {
				tmpDecomposition += tmp%10;
				tmp/=10;
			}	
			
			if(tmpDecomposition == decomposition) {
				System.out.println(i);
				return;
			}
			else if(i==decomposition-1){
				System.out.println(0);
			return;
			}
		}		
	}
}