Hello World

Collapse
X
 
  • Time
  • Show
Clear All
new posts
  • boxfish
    Recognized Expert Contributor
    • Mar 2008
    • 469

    Hello World

    Happy Hello World Day to the C/C++ forum! Today is the day to write cryptic "Hello World" programs and say hello to at least ten people:
    Code:
    #include <iostream>
    using namespace std;
    int main() {
        char oldHello[] = "Happy Whirl!";
        char newHello[] = "Jello(~orld)";
        int badChars[] = {1, 2, 3, 4, 7, 8, 9, 10};
        cout << oldHello;
        int j = 7;
        for (int i = 11; i >= 0; i--) {
            cout << '\b';
            if (badChars[j] == i) {
                cout << newHello[i] << '\b';
                j--;
            }
        }
        cout << endl;
        cin.get();
        return 0;
    }
    Hello to the C/C++ people:
    weaknessforcats (4660 posts)
    Banfa (3405 posts)
    sicarie (2837 posts)
    JosAH (2186 posts)
    Ganon11 (1819 posts)
    gpraghuram (1095 posts)
    horace1 (1059 posts)
    Savage (1018 posts)
    AdrianH (977 posts)
    RedSon (685 posts)
    BISKOT188 (1 post)
    Gregor McAlen (9 posts)
    sandeepkavade (18 posts)
    mohanht (1 post)

    (Follow the link and it will make sense.)
  • Ganon11
    Recognized Expert Specialist
    • Oct 2006
    • 3651

    #2
    Code:
    #include <iostream>
    #include <vector>
    using namespace std;
    
    struct prime_factor {
    	int prime, exp;
    };
    
    int buildNum(vector<prime_factor> factors);
    
    int main() {
    	vector<vector<prime_factor> > characters;
    	vector<prime_factor> factors;
    	prime_factor factor;
    	
    	factor.prime = 2;
    	factor.exp = 3;
    	factors.push_back(factor);
    	factor.prime = 3;
    	factor.exp = 2;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 101;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 2;
    	factors.push_back(factor);
    	factor.prime = 3;
    	factor.exp = 3;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 2;
    	factors.push_back(factor);
    	factor.prime = 3;
    	factor.exp = 3;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 111;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 2;
    	factors.push_back(factor);
    	factor.prime = 11;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 5;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 3;
    	factor.exp = 1;
    	factors.push_back(factor);
    	factor.prime = 29;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 111;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 1;
    	factors.push_back(factor);
    	factor.prime = 3;
    	factor.exp = 1;
    	factors.push_back(factor);
    	factor.prime = 19;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 2;
    	factors.push_back(factor);
    	factor.prime = 3;
    	factor.exp = 3;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 2;
    	factor.exp = 2;
    	factors.push_back(factor);
    	factor.prime = 5;
    	factor.exp = 2;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	factor.prime = 3;
    	factor.exp = 1;
    	factors.push_back(factor);
    	factor.prime = 11;
    	factor.exp = 1;
    	factors.push_back(factor);
    	characters.push_back(factors);
    	factors.clear();
    	
    	int len = characters.size();
    	for (int i = 0; i < len; i++)
    		cout << (char)buildNum(characters[i]);
    		
    	cout << endl;
    	
    	system("PAUSE");
    	return 0;
    }
    
    int buildNum(vector<prime_factor> factors) {
    	int len = factors.size(), sum = 1;
    	for (int i = 0; i < len; i++) {
    		int product = 1;
    		int len2 = factors[i].exp;
    		for (int j = 0; j < len2; j++) {
    			product *= factors[i].prime;
    		}
    		sum *= product;
    	}
    	return sum;
    }
    Mmmm, obfuscation.

    Comment

    • boxfish
      Recognized Expert Contributor
      • Mar 2008
      • 469

      #3
      Hello, Ganon11. I'm very impressed at how obfusticated that is.
      Originally posted by Banfa
      Well this would be a C entry

      ...

      Although I am sure Jos could do better I am a mere amateur at obfuscation compared to him.
      I like it. I'm putting it in this thread as well:
      Code:
      #include <stdio.h>
      int main(int O, char *_O[]){static char O0[]=
      {0111,0147,0157,0150,0152,0046,0120,0147,0173
      ,0146,0157,0055,0007};if(O>sizeof O0)return 0
      ;putchar(O0[O-!0]^O);main(O+!0,_O);return 0;}

      Comment

      Working...