結果
問題 | No.2699 Simple Math (Returned) |
ユーザー |
|
提出日時 | 2024-03-29 21:35:00 |
言語 | C# (.NET 8.0.404) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,404 bytes |
コンパイル時間 | 13,437 ms |
コンパイル使用メモリ | 168,868 KB |
実行使用メモリ | 221,120 KB |
最終ジャッジ日時 | 2024-09-30 15:41:05 |
合計ジャッジ時間 | 18,505 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 2 WA * 9 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (97 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
namespace AtCoder;#nullable enableusing System.Numerics;readonly record struct ModInt :IEqualityOperators<ModInt, ModInt, bool>,IAdditiveIdentity<ModInt, ModInt>,IAdditionOperators<ModInt, ModInt, ModInt>,IUnaryNegationOperators<ModInt, ModInt>,ISubtractionOperators<ModInt, ModInt, ModInt>,IMultiplicativeIdentity<ModInt, ModInt>,IMultiplyOperators<ModInt, ModInt, ModInt>,IDivisionOperators<ModInt, ModInt, ModInt>{int V { get; init; }public const int Mod = 998244353;public ModInt(long value){var v = value % Mod;if (v < 0) v += Mod;V = (int)v;}ModInt(int value) { V = value; }public static implicit operator ModInt(long v) => new(v);public static implicit operator int(ModInt modInt) => modInt.V;public static ModInt operator +(ModInt a, ModInt b){var v = a.V + b.V;if (v >= Mod) v -= Mod;return new(v);}public static ModInt operator -(ModInt a) => new(a.V == 0 ? 0 : Mod - a.V);public static ModInt operator -(ModInt a, ModInt b){var v = a.V - b.V;if (v < 0) v += Mod;return new(v);}public static ModInt operator *(ModInt a, ModInt b) => new((int)((long)a.V * b.V % Mod));public static ModInt operator /(ModInt a, ModInt b){if (b == 0) throw new DivideByZeroException();var (d, x, _) = ExtendedGcd(b.V, Mod);if (d > 1) throw new DivideByZeroException();return x * a.V;}public ModInt Power(long p){if (p < 0) return (MultiplicativeIdentity / V).Power(-p);long res = 1;long k = V;while (p > 0){if ((p & 1) > 0) res = res * k % Mod;k = k * k % Mod;p >>= 1;}return res;}static (long d, long x, long y) ExtendedGcd(long a, long b){if (b == 0) return (a, 1, 0);var (d, x, y) = ExtendedGcd(b, a % b);return (d, y, x - a / b * y);}public static ModInt AdditiveIdentity => new(0);public static ModInt MultiplicativeIdentity => new(1);public override string ToString() => V.ToString();}static class Extensions{public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();}class AtCoder{object? Solve(){var t = Int();for (var i = 0; i < t; i++) Out(Solve2());return null;;}int Solve2(){ModInt ten = 10;var n = Int();var m = Int();var q = new PriorityQueue<(int, int), int>();q.Enqueue((n, 1), -n);q.Enqueue((0, -1), -1);ModInt nq = 0;var dm = m * 2;while (q.Count > 0){var (k, c) = q.Dequeue();if (k >= dm){var l = k % dm;q.Enqueue((l, c), -l);continue;}if (k >= m){q.Enqueue((k - m, -c), m - k);continue;}nq += ten.Power(k) * c;}return nq;}public static void Main() => new AtCoder().Run();public void Run(){var res = Solve();if (res != null){if (res is bool yes) res = yes ? "Yes" : "No";sw.WriteLine(res);}sw.Flush();}string[] input = Array.Empty<string>();int iter = 0;readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false };#pragma warning disable IDE0051string String(){while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0);return input[iter++];}T Input<T>() where T : IParsable<T> => T.Parse(String(), null);int Int() => Input<int>();void Out(object? x, string? separator = null){separator ??= Environment.NewLine;if (x is System.Collections.IEnumerable obj and not string){var firstLine = true;foreach (var item in obj){if (!firstLine) sw.Write(separator);firstLine = false;sw.Write(item);}}else sw.Write(x);sw.WriteLine();}#pragma warning restore IDE0051}