ACM Q10035

import java.util.Scanner;
public class Q10035 {
public static void main(String args[]) {
Scanner cin = new Scanner(System.in);
while(cin.hasNextInt()){
String x = cin.next();
String k = cin.next();
if(x.charAt(0)=='0' && k.charAt(0)=='0'){
break;
}
int Match_length=Math.max(x.length(), k.length());
char [] x1 = new char[Match_length];
char [] k1 = new char[Match_length];
int carry=0, count =0;
char[] x2 = x.toCharArray();
char[] k2 = k.toCharArray();
for(int i=0; i< x1.length; i++){
if(i< Match_length- x2.length){
x1[i] ='0';
}else{
x1[i] = x2[i+x2.length-Match_length];
}
}
for(int j=0; j< k1.length; j++){
if(j< Match_length- k2.length){
k1[j] ='0';
}else{
k1[j] = k2[j+k2.length-Match_length];
}
}
for(int p=Match_length-1; p>= 0; p--){
if(Integer.parseInt(Character.toString(x1[p]))+Integer.parseInt(Character.toString(k1[p]))+carry>=10){
carry = 1;
count ++;
}else{
carry =0;
}
}
if(count ==0){
System.out.println("No carry operation.");
}else if(count ==1){
System.out.println("1 carry operation.");
}else{
System.out.println(count+" carry operations.");
}
}

}
}