Hello World!

众所周知，在c++语言中，最难的题目便是输出"Hello World!"了（bushi）。那么，接下来我将为大家呈现这一题的答案代码：

#include<iostream>
//#include <istream>
//#include <ostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
#define Pair pair<int,int>
LL quickPow(LL a,LL b){ LL res = 1; while(b){if(b&1)res *= a; a *= a; b >>= 1;} return res; }
LL multMod(LL a,LL b,LL mod){ a %= mod; b  %= mod; LL res = 0; while(b){if(b&1)res = (res + a) % mod; a =(a <=1) % mod; b >>= 1; } return res%mod;}
LL quickMultPowMod(LL a, LL b,LL mod){ LL res = 1,k = a; while(b){if((b&1))res = multMod(res,k,mod) % mod; k = multMod(k,k,mod) % mod; b>>=1;} return res % mod;}
LL quickPowMod(LL a,LL b,LL mod){ LL res = 1; while(b){if(b & 1)res = (a*res)%mod; a=(a*a)%mod; b>>=1; } return res; }
LL getInv(LL a,LL mod){ return quickPowMod(a,mod-2,mod); }
LL GCD(LL x,LL y){ return !y?x:GCD(y,x%y); }
LL LCM(LL x,LL y){ return x/GCD(x,y)*y; }

/* TREE */template<typename T>struct BinaryTreeNode {T data;BinaryTreeNode<T>* leftChild;BinaryTreeNode<T>* rightChild;};

const double EPS = 1E-6;
const int MOD = 1000000000+7;
const int N = 1000+5;
const int dx[] = {0,0,-1,1,1,-1,1,1};
const int dy[] = {1,-1,0,0,-1,1,-1,1};
const LL MAX = -100000;
const LL MIN = 0X3f3f3f3f;

bool x = false;
char str[] = "Hello World!" ;
 
using namespace std;
 
int isRight(int n){
    bool Right = true;
    bool Wrong = false;
    if(n = true){
        return Right;
    }
    else {
        return Wrong;
    }
}

void isPrime(bool n){
    n = 1;
    if( !( !isRight(n) )){
        x = true;
    }
    else {
        x = false;
    }
}

int main (void){
    if(x = true){
            printf(str);
            cout << "\n";
    }
    else{
        cout<<"作者是个人物。";
    }
    return 0;
}