UVA 10035 - Primary Arithmetic UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main() { char a[20],b[20],e[20],d[20]; int p,c,i,l,s,len,y,k,n,j; while(scanf("%s%s",a,b)==2) { k=(a[0]-'0'); l=(b[0]-'0'); if(k==0&&l==0) break; l=strlen(a); len=strlen(b); if(l>len) { y=l; n=l-len; for(i=0;i=0;i--) { s=(e[i]-'0')+(d[i]-'0'); if(s>=10) { c++; e[i-1]++; } } if(c==0) printf("No carry operation.\n"); else if(c==1) printf("1 carry operation.\n"); else printf("%d carry operations.\n",c); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10035/10035.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read