結果
問題 | No.2891 Mint |
ユーザー | tobisatis |
提出日時 | 2024-09-13 23:27:17 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 256 ms / 2,000 ms |
コード長 | 4,273 bytes |
コンパイル時間 | 10,423 ms |
コンパイル使用メモリ | 169,864 KB |
実行使用メモリ | 191,132 KB |
最終ジャッジ日時 | 2024-09-13 23:27:35 |
合計ジャッジ時間 | 17,655 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
28,672 KB |
testcase_01 | AC | 55 ms
29,696 KB |
testcase_02 | AC | 66 ms
29,312 KB |
testcase_03 | AC | 53 ms
28,672 KB |
testcase_04 | AC | 53 ms
29,056 KB |
testcase_05 | AC | 54 ms
29,440 KB |
testcase_06 | AC | 256 ms
29,696 KB |
testcase_07 | AC | 53 ms
28,800 KB |
testcase_08 | AC | 55 ms
29,440 KB |
testcase_09 | AC | 55 ms
29,056 KB |
testcase_10 | AC | 54 ms
29,696 KB |
testcase_11 | AC | 53 ms
28,904 KB |
testcase_12 | AC | 53 ms
28,772 KB |
testcase_13 | AC | 55 ms
29,056 KB |
testcase_14 | AC | 55 ms
29,568 KB |
testcase_15 | AC | 54 ms
29,184 KB |
testcase_16 | AC | 54 ms
28,928 KB |
testcase_17 | AC | 181 ms
30,080 KB |
testcase_18 | AC | 122 ms
29,804 KB |
testcase_19 | AC | 116 ms
30,080 KB |
testcase_20 | AC | 163 ms
29,824 KB |
testcase_21 | AC | 114 ms
29,540 KB |
testcase_22 | AC | 200 ms
30,080 KB |
testcase_23 | AC | 104 ms
29,696 KB |
testcase_24 | AC | 160 ms
29,696 KB |
testcase_25 | AC | 229 ms
29,824 KB |
testcase_26 | AC | 215 ms
29,952 KB |
testcase_27 | AC | 200 ms
29,824 KB |
testcase_28 | AC | 235 ms
29,824 KB |
testcase_29 | AC | 117 ms
29,696 KB |
testcase_30 | AC | 168 ms
30,208 KB |
testcase_31 | AC | 122 ms
29,952 KB |
testcase_32 | AC | 183 ms
29,824 KB |
testcase_33 | AC | 138 ms
30,080 KB |
testcase_34 | AC | 146 ms
29,800 KB |
testcase_35 | AC | 162 ms
29,824 KB |
testcase_36 | AC | 174 ms
29,952 KB |
testcase_37 | AC | 54 ms
29,056 KB |
testcase_38 | AC | 55 ms
29,056 KB |
testcase_39 | AC | 54 ms
29,284 KB |
testcase_40 | AC | 54 ms
28,544 KB |
testcase_41 | AC | 56 ms
28,800 KB |
testcase_42 | AC | 56 ms
29,440 KB |
testcase_43 | AC | 55 ms
29,184 KB |
testcase_44 | AC | 56 ms
29,696 KB |
testcase_45 | AC | 56 ms
29,156 KB |
testcase_46 | AC | 55 ms
29,312 KB |
testcase_47 | AC | 54 ms
29,056 KB |
testcase_48 | AC | 54 ms
29,312 KB |
testcase_49 | AC | 54 ms
29,312 KB |
testcase_50 | AC | 53 ms
28,928 KB |
testcase_51 | AC | 54 ms
29,056 KB |
testcase_52 | AC | 54 ms
28,544 KB |
testcase_53 | AC | 53 ms
28,672 KB |
testcase_54 | AC | 54 ms
29,440 KB |
testcase_55 | AC | 55 ms
28,772 KB |
testcase_56 | AC | 54 ms
191,132 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (96 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 enable using 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 n = Input<long>(); var m = Input<long>(); ModInt ans = 0; if (n > m) { ans = m; ans *= n - m; } var sq = 1000000L; while (sq * sq <= m) sq++; sq = Math.Min(m, sq); for (var i = 1L; i <= Math.Min(n, sq); i++) ans += m % i; if (n <= sq) return ans; var inv2 = (ModInt)1 / 2; for (var i = 2L; i <= sq; i++) { var s = Math.Min(n, m / (i - 1)); var t = Math.Max(sq, m / i); if (s < t) continue; var d = s - t; var sr = m % s; ans += (sr + sr + (ModInt)(d - 1) * (i - 1)) * d * inv2; } return ans; } 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 }; string 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(); } }