すべてのチャレンジ
簡単 0件解決済み 正答率0%

Doubling Grains on a Chessboard

Calculate a square’s grain count and the total on all 64 squares.

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.

例

例 1
入力:
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"};

解説

The first six counts are 1, 2, 4, 8, 16, 32. The board total is 1 + 2 + … + 2⁶³ = 2⁶⁴ − 1.

例 2
入力:
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"};

解説

The first square holds 1 grain. The second output always refers to all 64 squares, not just the requested prefix.

参考資料

この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。

他の人の解答から学ぶ

コミュニティの解答

まだ公開された解答がありません。この課題を解いて最初の解答を共有しましょう。