|
| 1 | +//https://www.acmicpc.net/problem/4388 |
| 2 | +import java.io.BufferedReader; |
| 3 | +import java.io.IOException; |
| 4 | +import java.io.InputStreamReader; |
| 5 | +import java.util.StringTokenizer; |
| 6 | + |
| 7 | +public class BOJ_B2_4388_받아올림 { |
| 8 | + public static void main(String[] args) throws IOException { |
| 9 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 10 | + StringBuilder sb = new StringBuilder(); |
| 11 | + StringTokenizer st; |
| 12 | + |
| 13 | + while(true) { |
| 14 | + st = new StringTokenizer(br.readLine()); |
| 15 | + String n1 = st.nextToken(); |
| 16 | + String n2 = st.nextToken(); |
| 17 | + |
| 18 | + if(n1.equals("0") && n2.equals("0")) break; |
| 19 | + |
| 20 | + int [] arr1 = new int[n1.length()]; |
| 21 | + for (int i = 0; i < n1.length(); i++) { |
| 22 | + arr1[i] = n1.charAt(n1.length()-1-i) - '0'; |
| 23 | + } |
| 24 | + |
| 25 | + int [] arr2 = new int[n2.length()]; |
| 26 | + for (int i = 0; i < n2.length(); i++) { |
| 27 | + arr2[i] = n2.charAt(n2.length()-1-i) - '0'; |
| 28 | + } |
| 29 | + |
| 30 | + int cnt = getCnt(arr1, arr2); |
| 31 | + |
| 32 | + sb.append(cnt).append("\n"); |
| 33 | + |
| 34 | + } |
| 35 | + |
| 36 | + System.out.println(sb.toString()); |
| 37 | + |
| 38 | + } |
| 39 | + |
| 40 | + private static int getCnt(int[] arr1, int[] arr2) { |
| 41 | + int cnt = 0; |
| 42 | + boolean needAdd = false; |
| 43 | + |
| 44 | + for (int i = 0; i < Math.max(arr1.length, arr2.length); i++) { |
| 45 | + int num1 = arr1.length > i ? arr1[i] : 0; |
| 46 | + int num2 = arr2.length > i ? arr2[i] : 0; |
| 47 | + |
| 48 | + int sum = num1 + num2; |
| 49 | + if(needAdd) sum++; |
| 50 | + |
| 51 | + if(sum >= 10) { |
| 52 | + cnt++; |
| 53 | + needAdd = true; |
| 54 | + } else { |
| 55 | + needAdd = false; |
| 56 | + } |
| 57 | + } |
| 58 | + return cnt; |
| 59 | + } |
| 60 | +} |
0 commit comments