結果

問題 No.2963 Mecha DESU
ユーザー tobisatistobisatis
提出日時 2024-11-16 15:50:40
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 707 ms / 2,000 ms
コード長 4,331 bytes
コンパイル時間 13,663 ms
コンパイル使用メモリ 166,816 KB
実行使用メモリ 196,312 KB
最終ジャッジ日時 2024-11-16 15:51:24
合計ジャッジ時間 35,442 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
30,588 KB
testcase_01 AC 59 ms
30,848 KB
testcase_02 AC 58 ms
31,104 KB
testcase_03 AC 59 ms
31,104 KB
testcase_04 AC 57 ms
30,848 KB
testcase_05 AC 59 ms
31,104 KB
testcase_06 AC 58 ms
30,976 KB
testcase_07 AC 59 ms
30,976 KB
testcase_08 AC 63 ms
31,104 KB
testcase_09 AC 59 ms
30,720 KB
testcase_10 AC 61 ms
31,104 KB
testcase_11 AC 60 ms
31,104 KB
testcase_12 AC 60 ms
31,104 KB
testcase_13 AC 674 ms
49,920 KB
testcase_14 AC 707 ms
49,792 KB
testcase_15 AC 635 ms
49,764 KB
testcase_16 AC 650 ms
49,660 KB
testcase_17 AC 669 ms
50,176 KB
testcase_18 AC 647 ms
49,920 KB
testcase_19 AC 651 ms
50,048 KB
testcase_20 AC 423 ms
45,440 KB
testcase_21 AC 135 ms
46,208 KB
testcase_22 AC 111 ms
38,528 KB
testcase_23 AC 89 ms
44,544 KB
testcase_24 AC 446 ms
43,008 KB
testcase_25 AC 450 ms
47,872 KB
testcase_26 AC 595 ms
44,140 KB
testcase_27 AC 318 ms
39,680 KB
testcase_28 AC 581 ms
49,280 KB
testcase_29 AC 457 ms
47,360 KB
testcase_30 AC 92 ms
36,480 KB
testcase_31 AC 231 ms
44,160 KB
testcase_32 AC 145 ms
37,116 KB
testcase_33 AC 468 ms
47,220 KB
testcase_34 AC 413 ms
48,380 KB
testcase_35 AC 188 ms
39,424 KB
testcase_36 AC 423 ms
43,392 KB
testcase_37 AC 120 ms
44,908 KB
testcase_38 AC 228 ms
38,132 KB
testcase_39 AC 435 ms
43,904 KB
testcase_40 AC 351 ms
39,424 KB
testcase_41 AC 525 ms
44,800 KB
testcase_42 AC 456 ms
46,332 KB
testcase_43 AC 648 ms
48,896 KB
testcase_44 AC 553 ms
46,208 KB
testcase_45 AC 582 ms
43,384 KB
testcase_46 AC 283 ms
42,112 KB
testcase_47 AC 420 ms
39,276 KB
testcase_48 AC 208 ms
40,812 KB
testcase_49 AC 382 ms
36,224 KB
testcase_50 AC 695 ms
45,052 KB
testcase_51 AC 687 ms
45,312 KB
testcase_52 AC 645 ms
45,312 KB
testcase_53 AC 544 ms
41,216 KB
testcase_54 AC 669 ms
40,828 KB
testcase_55 AC 61 ms
31,104 KB
testcase_56 AC 60 ms
30,976 KB
testcase_57 AC 222 ms
33,664 KB
testcase_58 AC 86 ms
46,208 KB
testcase_59 AC 60 ms
196,312 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (112 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/

ソースコード

diff # 

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;
    }

    static long Power(long v, ulong p, long mod)
    {
        var (res, k) = (1L, v);
        while (p > 0)
        {
            if ((p & 1) > 0) res = res * k % mod;
            k = k * k % mod;
            p >>= 1;
        }
        return res;
    }
    public ModInt Power(long p) => p < 0 ? (MultiplicativeIdentity / V).Power(-p) : Power(V, (ulong)p, Mod);

    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 = Int();
        var m = Int();
        var k = Int();
        var az = m.Repeat(Int);
        
        var max = 1000000;
        var cz = new int[max + 1];
        foreach (var a in az) cz[a]++;
        var hz = new int[n + 1];
        for (var i = 1; i <= max; i++)
        {
            var c = cz[i];
            if (c > 0)
            {
                for (var j = i; j <= n; j += i)
                {
                    hz[j] += c;
                }
            }
        }
        ModInt ans = 0;
        var invM = (ModInt)1 / m;
        for (var i = 1; i <= n; i++)
        {
            var h = invM * hz[i];
            var q = 1 - h;
            ans += 1 - q.Power(k);
        }
        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();
    }
}
0