Let's turn the tables. Give me your most inefficient method of printing hello world.

+/u/CompileBot C++

include <iostream>

int main() { int* A = new int[12]; char C[12]; for (int i(0); i < 12; i++) { (A + i) = (0x5f3759df - (i << 1)) % (i+42); } int x = 5; for (int i(0); i < 3; i++) { for (int j(0); j < 2; j++) { for (int k(0); k < 2; k++) { int tmp = (A + i + 3 * j + 6 * k); if ((i == 2 && j == 0 && k == 0) || (i == 0 && j == 1)) { if (!(x % 2)) { x++; } tmp += (1-(tmp >> x)) * (0x10 + x); tmp *= 3; } else if (i == 1 && j ^ k) { if (x % 2) { x--; } *tmp += ((tmp + 1)% 2) * -(x+1) + (10x + x) * 2; } else if (!(i|j|k)) { *tmp *= x; (tmp)--; } else if (!k && (i-1) == j) { tmp += '\r' + (j != 1)('@' + x); } else if (tmp == 3) { *tmp = (tmp)(33 + 7 * (1-j)) + ((1-j)(-2) + 1); } else {

                if (!j) { goto l1; }
                goto l2;
            l1:
                *tmp = 3 * (*tmp - 3);
                goto l3;
            l2:
                int y = (*tmp);
                for (int a(1); a < (x - y); a++) {
                    *tmp *= *tmp;
                }
                *tmp *= 2;
                (*tmp)++;
            l3:;
            }
            C[i + 3 * j + 6 * k] = (char)*tmp;
        }
    }
}
for (int i(0); i < 12; i++) {
    std::cout << C[i];
}
std::cout << std::endl;
delete A;
system("pause");
return 0;

}

/r/ProgrammerHumor Thread Parent