Doubling Grains on a Chessboard

Square 1 holds one grain. Each later square holds twice as many grains as the previous square. Return both the count on the requested square and the total on squares 1 through 64. Write each count as decimal text, because the board total is too large for a signed 64-bit integer.

Implement chessboard_grains(square).

Input

square: The requested square, numbered from 1.

Output

Return two decimal strings: [count on the requested square, total on all 64 squares].

सीमाएँ

1 ≤ square ≤ 64. Output strings contain decimal digits only, with no commas, spaces, or leading zeros.

उदाहरण

इनपुट:
square = 6

अपेक्षित आउटपुट:
expected = ["32", "18446744073709551615"]

इनपुट:
long long square = 6;

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"32", "18446744073709551615"};

इनपुट:
long square = 6;

अपेक्षित आउटपुट:
string[] expected = new string[] {"32", "18446744073709551615"};

इनपुट:
square = 1

अपेक्षित आउटपुट:
expected = ["1", "18446744073709551615"]

इनपुट:
long long square = 1;

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"1", "18446744073709551615"};

इनपुट:
long square = 1;

अपेक्षित आउटपुट:
string[] expected = new string[] {"1", "18446744073709551615"};

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

• Grains