백준 알고리즘 - 1110 (더하기사이클)
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Boj_1110 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int[] splitNum = new int[2];
int inputNum = Integer.parseInt(br.readLine());
int sum = inputNum;
int newNum;
int cycle = 0;
if(inputNum < 10) {
splitNum[0] = 0;
splitNum[1] = inputNum;
} else {
splitNum[0] = inputNum / 10;
splitNum[1] = inputNum % 10;
}
while(true) {
sum = splitNum[0] + splitNum[1];
splitNum[0] = splitNum[1];
splitNum[1] = sum % 10;
cycle++;
if( ((splitNum[0] * 10) + splitNum[1]) == inputNum) {
System.out.println(cycle);
break;
}
}
}
}