Professor Farouk Question
Link to the question : PROFF
HINT :
Just simple brute force. Add one digit at a time from right to left and check if there is a carry. Keep in mind some corner cases.
RECOMMENDED QUESTION :
Try your hands on this question : Headshot
SOLUTION :
/* PROFF *//* Sushant Gupta */#include<stdio.h>#include<string.h>int main(){long long int x1=1,x2=1,n1,n2;while(1){scanf("%lld%lld",&x1,&x2);if(x1==0 && x2==0)return 0;else{n1 = x1;n2 = x2;int s=0,c=0;while(n1 || n2){s = ((n1 %10) + (n2 %10) + s >=10);c = c+s;n1 = n1/10;n2 = n2/10;/*if(s>9){c++;f=1;}else if(s==9){if(f==1)c++;elsef= 0;}elsef= 0; */}if(c==0)printf("No carry operation.\n");else if(c==1)printf("1 carry operation.\n");elseprintf("%d carry operations.\n",c);}}}
No comments:
Post a Comment