結果

問題 No.1540 級数おもちゃ
コンテスト
ユーザー KumaTachiRen
提出日時 2022-03-17 14:22:15
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 201 ms / 2,000 ms
コード長 5,165 bytes
コンパイル時間 14,274 ms
コンパイル使用メモリ 169,384 KB
実行使用メモリ 184,652 KB
最終ジャッジ日時 2024-10-01 10:12:21
合計ジャッジ時間 21,244 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 31
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /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/

ソースコード

diff #
raw source code 

using System;
using System.Linq;
using System.Numerics;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Text;
using N = System.Int64;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}

public class Solver
{
    public void Solve()
    {
        int n = ri;
        var a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ri;

        ModInt[] p = new ModInt[n + 3];
        ModInt[] q = new ModInt[n + 3];
        ModInt[] r = new ModInt[n + 3];
        p[0] = 0;
        p[1] = 4;
        p[2] = 0;
        q[0] = 0;
        q[1] = -2;
        q[2] = -1;
        r[0] = (ModInt)1 / 3;
        r[1] = 0;
        r[2] = (ModInt)2 / 3;
        for (int j = 3; j < n; j++)
        {
            ModInt inv = (ModInt)1 / j;
            p[j] = inv * (j - 1) * 4 * p[j - 2];
            q[j] = inv * ((j - 1) * 4 * q[j - 2] - 2);
            r[j] = inv * (j - 1) * 4 * r[j - 2];
        }
        ModInt x = 0, y = 0, z = 0;
        for (int j = 0; j < n; j++)
        {
            x += p[j] * a[j];
            y += q[j] * a[j];
            z += r[j] * a[j];
        }
        Write($"{x} {y} {z}");
    }

    struct ModInt
    {
        private const long _mod = 998244353;
        long Val;
        public ModInt(long v) { Val = v; }
        public override string ToString() { return Val.ToString(); }
        public override bool Equals(object obj) => obj is ModInt other && this.Equals(other);
        public bool Equals(ModInt x) => Val == x.Val;
        public override int GetHashCode() => Val.GetHashCode();
        public static bool operator ==(ModInt a, ModInt b) { return a.Val == b.Val; }
        public static bool operator !=(ModInt a, ModInt b) { return a.Val != b.Val; }
        public static implicit operator ModInt(long n)
        {
            long r = n % _mod;
            return new ModInt(r < 0 ? r + _mod : r);
        }
        public static ModInt operator +(ModInt a, ModInt b)
        {
            long r = a.Val + b.Val;
            return new ModInt(r < _mod ? r : r - _mod);
        }
        public static ModInt operator -(ModInt a, ModInt b)
        {
            long r = a.Val - b.Val;
            return new ModInt(r < 0 ? r + _mod : r);
        }
        public static ModInt operator -(ModInt a) => new ModInt(a.Val == 0 ? 0 : _mod - a.Val);
        public static ModInt operator *(ModInt a, ModInt b) => new ModInt(a.Val * b.Val % _mod);
        public static ModInt operator /(ModInt a, ModInt b) => a * b.Inv;
        public ModInt Pow(long n)
        {
            long t = Val, r = 1;
            while (n > 0)
            {
                if ((n & 1) == 1) r = r * t % _mod;
                t = t * t % _mod;
                n >>= 1;
            }
            return new ModInt(r);
        }
        public ModInt Inv { get { return this.Pow(_mod - 2); } }
    }
    const long inf = (long)1 << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    void WriteJoin<T>(string s, T[] t) { Console.WriteLine(string.Join(s, t)); }
    void WriteJoin<T>(string s, List<T> t) { Console.WriteLine(string.Join(s, t)); }
    void Write<T>(T t) { Console.WriteLine(t.ToString()); }
    void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }
    void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }
    void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }
}



public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private readonly Stream str;
    private readonly byte[] buf = new byte[1024];
    private int len, ptr;
    public bool isEof = false;
    public bool IsEndOfStream { get { return isEof; } }
    private byte read()
    {
        if (isEof) throw new EndOfStreamException();
        if (ptr >= len)
        {
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) <= 0)
            {
                isEof = true;
                return 0;
            }
        }
        return buf[ptr++];
    }
    public char Char()
    {
        byte b = 0;
        do b = read();
        while (b < 33 || 126 < b);
        return (char)b;
    }
    public string Scan()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
            sb.Append(b);
        return sb.ToString();
    }
    public long Integer()
    {
        long ret = 0; byte b = 0; var ng = false;
        do b = read();
        while (b != '-' && (b < '0' || '9' < b));
        if (b == '-') { ng = true; b = read(); }
        for (; true; b = read())
        {
            if (b < '0' || '9' < b)
                return ng ? -ret : ret;
            else ret = ret * 10 + b - '0';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}
0