結果

問題 No.220 世界のなんとか2
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-05-30 00:43:41
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 25 ms / 1,000 ms
コード長 4,886 bytes
コンパイル時間 916 ms
コンパイル使用メモリ 117,296 KB
実行使用メモリ 27,840 KB
最終ジャッジ日時 2024-07-06 12:24:31
合計ジャッジ時間 2,010 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
23,724 KB
testcase_01 AC 24 ms
25,820 KB
testcase_02 AC 25 ms
25,540 KB
testcase_03 AC 23 ms
27,840 KB
testcase_04 AC 22 ms
25,672 KB
testcase_05 AC 22 ms
23,500 KB
testcase_06 AC 21 ms
21,556 KB
testcase_07 AC 22 ms
23,520 KB
testcase_08 AC 22 ms
23,520 KB
testcase_09 AC 22 ms
25,668 KB
testcase_10 AC 23 ms
25,672 KB
testcase_11 AC 23 ms
23,520 KB
testcase_12 AC 22 ms
21,680 KB
testcase_13 AC 22 ms
23,852 KB
testcase_14 AC 22 ms
23,524 KB
testcase_15 AC 22 ms
23,764 KB
testcase_16 AC 23 ms
25,792 KB
testcase_17 AC 22 ms
23,652 KB
testcase_18 AC 21 ms
23,988 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var p = sc.Integer();
            var tens = new ulong[20]; tens[0] = 1;
            for (int i = 1; i < 20; i++)
                tens[i] = tens[i - 1] * 10;
            var k = tens[p] / 3;
            var dp = new ulong[2, p + 1, 3];
            dp[0, 0, 0] = 1;
            for (int i = 0; i < p; i++)
            {
                for (int m = 0; m < 3; m++)
                {
                    for (uint j = 0; j < 10; j++)
                    {
                        var add = (int)((j * tens[p - i - 1]) % 3);
                        if (j == 3)
                            dp[1, i + 1, (m + add) % 3] += dp[0, i, m];
                        else dp[0, i + 1, (m + add) % 3] += dp[0, i, m];
                        dp[1, i + 1, (m + add) % 3] += dp[1, i, m];
                    }
                }
            }
            var ans = (dp[1, p, 0] - 1) + dp[1, p, 1] + dp[1, p, 2] + dp[0, p, 0];
            IO.Printer.Out.WriteLine(ans);



        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public 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) return 0;
            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) && !isEof); 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 Long()
        {
            if (isEof) return long.MinValue;
            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 int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}

static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
0