結果

問題 No.2614 Delete ABC
ユーザー tobisatistobisatis
提出日時 2024-01-26 21:33:53
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 5,288 bytes
コンパイル時間 8,700 ms
コンパイル使用メモリ 167,760 KB
実行使用メモリ 191,260 KB
最終ジャッジ日時 2024-09-28 07:44:25
合計ジャッジ時間 8,269 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (105 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;
using System.Text;

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 FactorialExtensions
{
    static ModInt[] fac = Array.Empty<ModInt>();
    static ModInt[] inv = Array.Empty<ModInt>();
    const uint Capacity = 1 << 24;
    
    static void Resize(uint n)
    {
        if (n < fac.Length) return;
        var s = 1;
        while (s < n && s < Capacity) s <<= 1;
        fac = new ModInt[s + 1];
        fac[0] = 1;
        for (var i = 1; i <= s; i++) fac[i] = fac[i - 1] * i;
        inv = new ModInt[s + 1];
        inv[s] = fac[0] / fac[s];
        for (var i = s; i > 0; i--) inv[i - 1] = inv[i] * i;
    }

    public static ModInt Factorial(this int n) { Resize((uint)Math.Abs(n)); return n < 0 ? inv[-n] : fac[n]; }

    public static ModInt C(this int n, int r)
    {
        if (r < 0 || n < r) return 0;
        if (n <= Capacity) return Factorial(n) * Factorial(r - n) * Factorial(-r);
        if (n - r < r) return C(n, n - r);
        var res = fac[0];
        for (var i = n; i > n - r; i--) res *= i;
        return res * Factorial(-r);
    }
    public static ModInt P(this int n, int r) => C(n, r) * Factorial(-r);
    public static ModInt H(this int n, int r) => C(n + r - 1, r);
}

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();
        var ans = new List<string>();
        var s2 = "ABACBC";
        var s3 = "ABACABCBC";
        for (var i = 0; i < t; i++)
        {
            var n = Int();
            var s = new StringBuilder();
            while (n > 3)
            {
                s.Append(s2);
                n -= 2;
            }
            if (n == 3) s.Append(s3);
            else s.Append(s2);
            ans.Add(s.ToString());
        }
        Out(ans);
        return null;
    }

    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 IDE0051
    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();
    }
    #pragma warning restore IDE0051
}
0