[백준] 2231 (분해합)

#1 알고리즘

 

#2 코드

#2-1 자바

import java.util.Scanner;

public class Main {
	private static int lowestGenerator = 0;
	
    public static void main(String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int N = sc.nextInt();
    	sc.nextLine();
    	sc.close();
    	
    	int bunHaeHap;
    	for(int i = 1; i < N; i++) {
    		bunHaeHap = i + digitSum(i);
    		
    		if(bunHaeHap == N) {
    			saveIfLowestGenerator(i);
    		} 
    	}
    	
    	System.out.println(Integer.toString(lowestGenerator));
    }
    
    private static int digitSum(int number) {
    	int sum = 0;
    	
    	String numberString = Integer.toString(number);
    	for(int i = 0; i < numberString.length(); i++) {
    		sum += Character.getNumericValue(numberString.charAt(i));
    	}
    	
    	return sum;
    }
    
    private static void saveIfLowestGenerator(int number) {
    	if(lowestGenerator == 0) {
    		lowestGenerator = number;
    		return;
    	}
    	
    	if(number < lowestGenerator) {
    		lowestGenerator = number;
    	}
    }
}

 

#2-2 코틀린

var lowestGenerator : Int = 0

fun main() {
    val N = readLine()!!.trim().toInt()

    var bunHaeHap = -1
    for(i : Int in 1..(N - 1)) {
        bunHaeHap = i + digitSum(i)

        if(bunHaeHap == N) {
            saveIfLowestGenerator(i)
        }
    }

    println(lowestGenerator.toString())
}

fun digitSum(number : Int) : Int {
    var sum = 0

    for(c : Char in number.toString()) {
        sum += Character.getNumericValue(c)
    }

    return sum
}

fun saveIfLowestGenerator(number: Int) {
    if(lowestGenerator == 0) {
        lowestGenerator = number
        return
    }
    
    if(number < lowestGenerator) {
        lowestGenerator = number
    }
}