結果
問題 | No.2940 Sigma Sigma Div Floor Problem |
ユーザー | tobisatis |
提出日時 | 2024-10-18 21:31:29 |
言語 | C# (.NET 8.0.203) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,711 bytes |
コンパイル時間 | 25,781 ms |
コンパイル使用メモリ | 169,980 KB |
実行使用メモリ | 40,320 KB |
最終ジャッジ日時 | 2024-10-18 22:14:20 |
合計ジャッジ時間 | 35,401 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
32,256 KB |
testcase_01 | AC | 54 ms
28,788 KB |
testcase_02 | AC | 54 ms
29,312 KB |
testcase_03 | AC | 90 ms
30,964 KB |
testcase_04 | AC | 55 ms
29,312 KB |
testcase_05 | AC | 55 ms
28,928 KB |
testcase_06 | AC | 55 ms
28,800 KB |
testcase_07 | AC | 56 ms
29,056 KB |
testcase_08 | AC | 56 ms
28,928 KB |
testcase_09 | AC | 56 ms
29,056 KB |
testcase_10 | AC | 57 ms
28,796 KB |
testcase_11 | AC | 65 ms
29,952 KB |
testcase_12 | AC | 75 ms
30,976 KB |
testcase_13 | AC | 65 ms
29,952 KB |
testcase_14 | AC | 78 ms
29,824 KB |
testcase_15 | AC | 75 ms
30,336 KB |
testcase_16 | AC | 60 ms
29,696 KB |
testcase_17 | AC | 503 ms
40,320 KB |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
08_evil_01.txt | -- | - |
08_evil_02.txt | -- | - |
08_evil_03.txt | -- | - |
08_evil_04.txt | -- | - |
08_evil_05.txt | -- | - |
08_evil_06.txt | -- | - |
08_evil_07.txt | -- | - |
08_evil_08.txt | -- | - |
08_evil_09.txt | -- | - |
08_evil_10.txt | -- | - |
08_evil_11.txt | -- | - |
08_evil_12.txt | -- | - |
08_evil_13.txt | -- | - |
08_evil_14.txt | -- | - |
08_evil_15.txt | -- | - |
08_evil_16.txt | -- | - |
08_evil_17.txt | -- | - |
08_evil_18.txt | -- | - |
08_evil_19.txt | -- | - |
08_evil_20.txt | -- | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (106 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(); public static long Root(this long x, int root = 2) { var limits = new long[] { 0, 0, 3037000500L, 2097152, 55109, 6209, 1449, 512, 235, 128, 79, 53, 39 }; if (x < 0 || root < 2 || root >= limits.Length) throw new Exception("not supported"); var pass = 0L; var fail = limits[root]; while (fail - pass > 1) { var middle = (fail + pass) >> 1; var next = 1L; for (var i = 0; i < root; i++) next *= middle; if (next <= x) pass = middle; else fail = middle; } return pass; } } class AtCoder { object? Solve() { var n = Int(); if (n > 10000000) return null; ModInt ans = 0; for (var i = 1L; i <= n; i++) { var sqi = i.Root(); for (var j = 1L; j <= i; j++) { var v = i / j; if (v < sqi) break; ans += v; } var lj = i; for (var s = 1L; s < sqi; s++) { var nj = i / (s + 1); ans += s * (lj - nj); lj = nj; } } 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()!.Trim().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(); } }