[HDOJ1000] A + B Problem

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=1000

Divine Questions

The code is as follows:

1#include <cstdio>2 #define_______ int3 #define________ while4 #define_________ return5 #define___________ If6 #define____________ Else7 #define_____________ printf8 #define______________ "%d\n"9 #define_______________ "%d%d"Ten #define________________ ~scanf One #define_________________ Main A #define__________________      , - #define___________________ 1 - #define$                       = the #define$_$                     == -  - //Please input the numbers (devided with a space) while you run it. - _______ _ __________________ __; +  - _______ ______(_______ _ __________________ _______ __) { +_______ ____ $ _ ^ __; A_______ ___ $ _ & __; at     ________(___) { -         _______ _____ $ ____; -_______ __________ $ ___ << ___________________; -____ $ _____ ^ __________; -___ $ _____ & __________; -     } in     _________ ____; - } to  + _______ ____(_______ ___) { -     ___________(___ $_$ _) _________ ___________________; the     ____________ _________ ______(____(______(___ __________________ ___________________)) *     __________________ ___________________); $ }Panax Notoginseng _______ _____(_______ ___) { -     ___________(___ $_$ __) _________ ___________________; the     ____________ _________ ______(_____(______(___ __________________ ___________________)) +     __________________ ___________________); A } the  +  - _______ _________________() { $________ (________________ (_______________ __________________ &_ __________________ &__)) $     _____________(______________ __________________ ______(____(___________________)  -     __________________ _____(___________________))); -}

Original

1#include <cstdio>2 3 intA, B;4 5 intCintXinty) {6     intXR = x ^y;7     intnd = x &y;8      while(nd) {9         intXR1 =XR;Ten         intNd1 = nd <<1; OneXR = xr1 ^Nd1; And = XR1 &Nd1; -     } -     returnXR; the } -  - intAintc) { -     if(c = =a) { +         return 1; -     } +     Else { A         returnC (A (C (c),1)),1); at     } - } - intBintc) { -     if(c = =b) { -         return 1; -     } in     Else { -         returnC (B (C,1)),1); to     } + } -  the  * intMain () { $      while(~SCANF ("%d%d", &a, &b)) {Panax Notoginsengprintf"%d\n", C (A (1), B (1))); -     } the}

View Code

And then tle.

[HDOJ1000] A + B Problem