結果
問題 | No.8037 Restricted Lucas (Hard) |
ユーザー |
👑 |
提出日時 | 2019-03-31 18:50:16 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 1,526 bytes |
コンパイル時間 | 582 ms |
コンパイル使用メモリ | 95,772 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-13 04:33:24 |
合計ジャッジ時間 | 1,242 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 6 |
ソースコード
import std.conv, std.stdio, std.string;enum long zero = ``.length;enum long one = `u`.length;enum long two = `us`.length;enum long three = `usa`.length;enum long four = `usag`.length;enum long five = `usagi`.length;enum long six = `usagiu`.length;enum long seven = `usagius`.length;enum long eight = `usagiusa`.length;enum long nine = `usagiusag`.length;enum long ten = `usagiusagi`.length;enum long eleven = `usagiusagiu`.length;enum long twelve = `usagiusagius`.length;enum long thirteen = `usagiusagiusa`.length;enum long fourteen = `usagiusagiusag`.length;enum long fifteen = `usagiusagiusagi`.length;T add(T)(T a, T b) {return mixin(`a ` ~ cast(char)(two << four | eleven) ~ ` b`);}T mul(T)(T a, T b) {return mixin(`a ` ~ cast(char)(two << four | ten) ~ ` b`);}T mod(T)(T a, T b) {return mixin(`a ` ~ cast(char)(two << four | five) ~ ` b`);}enum MO = add(ten^^nine, seven);long[] mul(long[] a, long[] b) {return [mod(add(mul(a[zero], b[zero]), mul(a[one], b[one])), MO),mod(add(add(mul(a[zero], b[one]), mul(a[one], b[zero])), mul(a[one], b[one])), MO)];}void main() {readln;for (string line; (line = readln) !is null; ) {const N = line.chomp.to!long;long[] x = [zero, one], y = [one, zero];for (long n = N; n; n >>= one) {if (n & one) {y = mul(y, x);}x = mul(x, x);}const ans = mod(add(mul(y[zero], two), mul(y[one], one)), MO);writeln(ans);}}