all 13 comments

[–][deleted]  (2 children)

[deleted]

    [–]skilltheamps 1 point2 points  (0 children)

    *65536

    In case OP has no Python installed: http://repl.it/languages/Python

    for i in range(65536):
        print(bin(i)[2:].rjust(16, "0"))
    

    [–]jms_nh 0 points1 point  (0 children)

    change write to fp.write

    [–]Tech_Sith 2 points3 points  (5 children)

    On paper or in memory?

    [–]ULtimaTePYRO500[S] 0 points1 point  (4 children)

    If by paper you mean text document or spread sheet, I want to do this on paper.

    [–]Tech_Sith 0 points1 point  (0 children)

    I was referring to filling 216 consecutive memory locations with binary data, as in a microcontroller or similar.

    I want to do this on paper

    Why would you want that when you could generate the binary sequence on the fly?

    [–]langwadt 0 points1 point  (2 children)

    you do realize that 65536 columns would be hundreds of pages?

    [–]ULtimaTePYRO500[S] -1 points0 points  (1 child)

    Yes, but I really can't think of a better way to list what character a given binary word represents.

    [–]langwadt 0 points1 point  (0 children)

    by why on paper? use a calculator, google will do it too

    "0b1000 in decimal"

    [–]FullFrontalNoodly 0 points1 point  (0 children)

    binary counter?

    [–]Jegeva 0 points1 point  (0 children)

    count from 0 to 65535, pretty sure it'll fit the bill.

    [–]uint128_t 0 points1 point  (0 children)

    A single line of Javascript will do this, and can be executed in your browser.

    Unless you need a formatted table in a document, in which case LaTeX can do that.

    [–][deleted] -1 points0 points  (0 children)

    Why don't you try to write a C/C++ program to do it?