UV problem solution: 10035-Primary Arithmatic

Simple problem. Just count it.

Code:

1. /*************************************** **********************************
2. * Copyright (c) 2008 by liukaipeng *
3. * Liukaipeng at gmail dot com *
4. **************************************** *********************************/
6. /* @ Judge_id 00000 10035 C ++ "primary arithmatic "*/
8. # Include <algorithm>
9. # Include <cstdio>
10. # Include <cstring>
11. # Include <deque>
12. # Include <fstream>
13. # Include <iostream>
14. # Include <list>
15. # Include <map>
16. # Include <queue>
17. # Include <set>
18. # Include <stack>
19. # Include <string>
20. # Include <vector>
22. Using namespace STD;
24. Int main (INT argc, char * argv [])
25. {
26. # Ifndef online_judge
27. Freopen (string (argv [0]) + ". In"). c_str (), "r", stdin );
28. Freopen (string (argv [0]) + ". Out"). c_str (), "W", stdout );
29. # Endif
31. Char const * msgs [] = {
32. "No carry operation .",
33. "1 carry operation .",
34. "2 carry operations .",
35. "3 carry operations .",
36. "4 carry operations .",
37. "5 carry operations .",
38. "6 carry operations .",
39. "7 carry operations .",
40. "8 Carry operations .",
41. "9 carry operations .",
42. };
44. Int A, B;
45. While (scanf ("% d/N", & A, & B )&&! (A = 0 & B = 0 )){
46. Int ncarries = 0;
47. For (INT carry = 0 ;! (A = 0 & B = 0); A/= 10, B/= 10 ){
48. Carry = (a % 10 + B % 10 + carry)/10;
49. Ncarries + = carry;
50. }
51. Puts (MSGs [ncarries]);
52. }
54. Return 0;
55. }
56.