結果

問題 No.8034 7 problems
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-04-01 12:35:52
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 38 ms / 2,000 ms
コード長 2,448 bytes
コンパイル時間 990 ms
コンパイル使用メモリ 120,236 KB
実行使用メモリ 10,148 KB
最終ジャッジ日時 2024-06-13 04:36:12
合計ジャッジ時間 4,722 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 51
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
enum MO = 10L^^9 + 7;
enum LIM = 10^^5 + 10;
long[] inv, fac, invFac;
void prepare() {
inv = new long[LIM];
fac = new long[LIM];
invFac = new long[LIM];
inv[1] = 1;
foreach (i; 2 .. LIM) {
inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
}
fac[0] = invFac[0] = 1;
foreach (i; 1 .. LIM) {
fac[i] = (fac[i - 1] * i) % MO;
invFac[i] = (invFac[i - 1] * inv[i]) % MO;
}
}
long power(long a, long e) {
long x = a % MO, y = 1;
for (; e; e >>= 1) {
if (e & 1) {
y = (y * x) % MO;
}
x = (x * x) % MO;
}
return y;
}
void main() {
prepare();
auto sum = new long[LIM];
foreach (i; 2 .. LIM) {
sum[i] = (sum[i - 1] + inv[i]) % MO;
}
try {
for (; ; ) {
const numCases = readInt();
foreach (caseId; 0 .. numCases) {
if (caseId > 0) {
writeln();
}
const N = readLong();
writeln(N * N);
writeln((N^^3 - N) * 1 + N * N);
writeln(numCases);
writeln(4 * N^^2 + 17);
writeln(power(N, N^^3));
writeln(N);
// https://oeis.org/A006675
long ans = sum[cast(size_t)(N)];
ans *= fac[cast(size_t)(N)];
ans %= MO;
ans *= N;
ans %= MO;
writeln(ans);
}
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0