結果
問題 | No.403 2^2^2 |
ユーザー |
|
提出日時 | 2017-08-21 17:40:55 |
言語 | D (dmd 2.109.1) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,739 bytes |
コンパイル時間 | 419 ms |
コンパイル使用メモリ | 131,320 KB |
最終ジャッジ日時 | 2024-11-14 20:13:57 |
合計ジャッジ時間 | 931 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(FactorRing!(1000000007, true))` to `int` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(LockingTextWriter, FactorRing!(1000000007, true), char)` error instantiating /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632): instantiated from here: `formatValue!(LockingTextWriter, FactorRing!(1000000007, true), char)` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/stdio.d(1759): instantiated from here: `formattedWrite!(LockingTextWriter, char, FactorRing!(1000000007, true))` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/stdio.d(4277): instantiated from here: `write!(FactorRing!(1000000007, true), string, FactorRing!(1000000007, true), char)` Main.d(20): instantiated from here: `writeln!(FactorRing!(1000000007, true), string, FactorRing!(1000000007, true))`
ソースコード
import std.algorithm, std.conv, std.range, std.stdio, std.string;const mod = 10 ^^ 9 + 7;alias FactorRing!(mod, true) mint1;alias FactorRing!(mod-1, true) mint2;void main(){auto rd = readln.chomp.split('^').to!(long[]), a = rd[0], b = rd[1], c = rd[2];auto ma = mint1(a);if (ma == 0) {writeln(0, " ", 0);return;}auto s1 = ma.repeatedSquare(b).repeatedSquare(c);auto s2 = ma.repeatedSquare(mint2(b).repeatedSquare(c).to!int);writeln(s1, " ", s2);}T repeatedSquare(T, alias pred = "a * b", U)(T a, U n){return repeatedSquare(a, n, T(1));}T repeatedSquare(T, alias pred = "a * b", U)(T a, U n, T init){import std.functional;alias predFun = binaryFun!pred;if (n == 0) return init;auto r = init;while (n > 0) {if ((n & 1) == 1)r = predFun(r, a);a = predFun(a, a);n >>= 1;}return r;}struct FactorRing(int m, bool pos = false){version(BigEndian) {union { long vl; struct { int vi2; int vi; } }} else {union { long vl; int vi; }}@property int toInt() { return vi; }alias toInt this;this(int v) { vi = v; }this(int v, bool runMod) { vi = runMod ? mod(v) : v; }this(long v) { vi = mod(v); }ref FactorRing!(m, pos) opAssign(int v) { vi = v; return this; }pure auto mod(int v) const{static if (pos) return v % m;else return (v % m + m) % m;}pure auto mod(long v) const{static if (pos) return cast(int)(v % m);else return cast(int)((v % m + m) % m);}static if (m < int.max / 2) {pure auto opBinary(string op: "+")(int rhs) const { return FactorRing!(m, pos)(mod(vi + rhs)); }pure auto opBinary(string op: "-")(int rhs) const { return FactorRing!(m, pos)(mod(vi - rhs)); }} else {pure auto opBinary(string op: "+")(int rhs) const { return FactorRing!(m, pos)(mod(vl + rhs)); }pure auto opBinary(string op: "-")(int rhs) const { return FactorRing!(m, pos)(mod(vl - rhs)); }}pure auto opBinary(string op: "*")(int rhs) const { return FactorRing!(m, pos)(mod(vl * rhs)); }pure auto opBinary(string op)(FactorRing!(m, pos) rhs) constif (op == "+" || op == "-" || op == "*") { return opBinary!op(rhs.vi); }static if (m < int.max / 2) {auto opOpAssign(string op: "+")(int rhs) { vi = mod(vi + rhs); }auto opOpAssign(string op: "-")(int rhs) { vi = mod(vi - rhs); }} else {auto opOpAssign(string op: "+")(int rhs) { vi = mod(vl + rhs); }auto opOpAssign(string op: "-")(int rhs) { vi = mod(vl - rhs); }}auto opOpAssign(string op: "*")(int rhs) { vi = mod(vl * rhs); }auto opOpAssign(string op)(FactorRing!(m, pos) rhs)if (op == "+" || op == "-" || op == "*") { return opOpAssign!op(rhs.vi); }}