問題一覧 > ネタ問題

No.8034 7 problems

レベル : / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 13
作問者 : ミドリムシ
お気に入りにしたユーザー ProblemId : 2220 / 自分の提出
問題文最終更新日: 2020-04-01 19:13:04
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
yukicoder April fool contest 2018 (順位表) の他の問題:

This problem was created for the yukicoder April fool contest.
It contains riddle elements, esper (guesswork) elements, and math elements. (Addendum: Consider solving the other problems too!)


Problem Statement

There is no such thing
Konrattan, who lives on Planet Kuran, was taking a test at school.
The test had $7$ problems, but he spilled the plastic bottle of water that was on his desk, and $5$ of the $7$ problems became unreadable.
Now what a mess! What should we do (no, "what should we do" is not the point here



Consider an integer sequence $a$ with $N^3$ elements, where each element is at least $1$ and at most $N$.
Q.???
 Find the number of possible sequences $a$.
 Since the answer can be large, output it modulo $10^9+7$.
Q.???
 Among the possible sequences $a$, find the $N^N$-th one in lexicographic order.
 However, since outputting the sequence as is would be troublesome, let $X$ be the answer sequence and output the hash value produced by the following pseudocode.

hash ← 0
for i = 1...$N^3$
    hash ← hash + $X_i$
hashを出力



find error....
(0.0%...11.4%...51.4%...81.0%...)
x is not defined
):
= is not appropriate; did you mean == ?
400000000000000000000000000 : integer literal is too large to be represented in any integer type
xenon is not defined
^o^
2e2222 : integer literal is too large to be represented in any decimal type
+ is an operator not defined in structure fight.
1 << 34 : Shift count >= width of type; did you mean 1l << 34 ?
7 errors

Input

$T$
$N_1$
$N_2$
:
$N_T$
$1 \leq T \leq 10^4$
$1 \leq N_i \leq 10^5$

There are $T$ test cases. The value of $N$ for the $i$-th test case is $N_i$.

Output

For $1$ test case, output $7$ lines.
On the $i$-th line, output the answer $Ans_i$ to the $i$-th question.
Insert a blank line between test cases.

Sample

Sample 1
Input
1
1
Output
1
1
1
21
1
1
0

Sample 2
Input
3
7
13
18
Output
49
385
3
213
658336416
7
56196

169
2353
3
693
908239535
13
484595888

324
6138
3
1313
216280545
18
337483408

Suihei Liebe Boku no Fune Yeah!

33-06-53-53
100111011000111101000110111111101011110100110010111011101101110110111011011111100111111010111100101100001110011011101011100111110000111000011110010111010101011101101000110000111010101101001110110111001010101100110101111011111101110110111111001111110101111001011000011100110111010111011101101001110100011000011101000110010111011101101110110011111000011101110110000111010010101110110101111011111101110110111111001111110101111001011000011100110111010111011101101001100111001011010110001110101111000011101001111001111011111110101111001111000011110011111010111100101110101010111010010011101011110000111010011101101110010111011101101111111001111011111110101111001111000011100100110010111010001100001101101101100010101100100100110111011101110110111111010001100001110111011011101101001110010011001011101001110001111010001101001111100111011111110101111001011000011101110110111011100111110101111010111101111101111110110111011111100011110100011010011101001111010011001011110011110010111010011110011111010111101011000001111011111011111110011110010111010011110011110010111010011110011110100011010010101100110001111010001101111111010111101001100101110111011011101001001010101101100011110100110111111000111101000110111111101011110100110010111011101101110100000111011101101111110000111010011100100110000111011101101001110100011001011101110110111011101111101111111010011100111110101110100111010111100001111001111101011110010111010101011101110011110111111101011110011110000111001111100001110111111101111100001111010011101001100001110000111101001101111110111011010011101000110000111010111101001110011111000011100100110010111010111101001111010011001011101001111001011101010101110110101111011111101011110111111001001100101010110011010111101001110111011011111110011111010111010111101111110000111101111101111010110001100101101001110101011011111110101100111011010011101011110000111011101101111111001111101011100010110010111101001100101110111011011111110011110010111010011110011111010111101011001010110111011010011110100111001111101011101001111010011001011101110110111111000111101000110111111101011110100110010111011101101110011000111101001101111110001111010001101111111010111101001100101110111011011101001010110111011011111101011111100111011111110010110100111011101101111111001111011111110101111011111000011110100110111111101001100101110100111001111101001111001111101011110010111010101011101110010110000111011101101110110010011000011101101111010111011101101001110101111011111110101111001111001011101001111001111000011110010110010111100101110101110101111010011101110110111111100111110101110101111011111100001110111011011111101011110100111101001100001110100111000111101000110100111101111101111101100011101001101111111001111010001101001111010011000011110100110111111010111101001010110010011100100001101100011101111101111011000101100001011110011100101010110110111110010011001011110111110000111101001110100110000111000011101101110000111100101101001111011111011111101101110111111101001101111110110111001011101110110000111100111100001110100101011101110100110000111001001100001111001111010001101001010110011010111101111110111011011111100001111010011000011101001110100011000011101011110000111011101100001111001011000011111010111010111100111100101110100111100111110101111010111011101101001110111011000011110010111010111010111101111111010011011111100111110000111100111101000110111111101011101101110010111010011100100110010111010111101001111001011101010101110

提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。