結果

問題 No.315 世界のなんとか3.5
コンテスト
ユーザー koyumeishi
提出日時 2015-12-01 04:50:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,153 ms / 2,000 ms
コード長 5,625 bytes
コンパイル時間 968 ms
コンパイル使用メモリ 116,156 KB
実行使用メモリ 23,696 KB
最終ジャッジ日時 2024-09-14 06:34:23
合計ジャッジ時間 16,117 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Collections;
using System.Collections.Generic;
using System.Linq;

namespace Program
{
	class Solver
	{
		private const long MOD = 1000000007;

		private long calc(ref String n, int p){
			long[,,] dp = new long[2,800,2*4*2];
			int u = 0;
			int v = 1;
			dp[0,0,0] = 1;
			int[] mooood3 = new int[12];
			for(int i=0; i<12; i++){
				mooood3[i] = i%3;
			}
			int sz = n.Length;
			for(int i=0; i<sz; i++){
				int k = ((int)n[i]) - ((int)'0');
				if(i<sz-5){

					for(int a=0;a<2;a++){
					for(int b=0;b<3;b++){
					for(int c=0;c<2;c++){
						int s = (a<<3)|(b<<1)|c;
						long val = dp[u,0,s];
						dp[u,0,s] = 0;

						for(int d=0;d<10;d++){
							if(a==0 && d>k){
								continue;
							}
							int a_ = a|(d<k?1:0);
							int b_ = mooood3[(b+d)];
							int c_ = c|(d==3?1:0);
							int s_ = (a_<<3)|(b_<<1)|c_;

							dp[v,0,s_] += val;
							if(dp[v,0,s_] >= MOD) dp[v,0,s_] -= MOD;
						}
					}}}
				}
				else{

					for(int j=0;j<p;j++){
					for(int a=0;a<2;a++){
					for(int b=0;b<3;b++){
					for(int c=0;c<2;c++){
						int s = (a<<3)|(b<<1)|c;
						long val = dp[u,j,s];
						dp[u,j,s] = 0;
						for(int d=0;d<10;d++){
							if(a==0 && d>k){
								continue;
							}
							int a_ = a|(d<k?1:0);
							int b_ = mooood3[(b+d)];
							int c_ = c|(d==3?1:0);
							int s_ = (a_<<3)|(b_<<1)|c_;
							int j_ = (j*10 + d) % p;
							dp[v,j_,s_] += val;
							if(dp[v,j_,s_] >= MOD) dp[v,j_,s_] -= MOD;
						}

						dp[u,j,s] = 0;
					}}}}
				}
				u ^= 1;
				v ^= 1;
			}

			long ret = 0;

			for(int j=1;j<p;j++){
			for(int b=0;b<3;b++){
			for(int c=0;c<2;c++){
				if(c==0 && b!=0){
					continue;
				}
				for(int a=0;a<2;a++){
					int s = (a<<3)|(b<<1)|c;
					ret += dp[u,j,s];
					if(ret>=MOD) ret -= MOD;
			}}}}

			return ret;
		}

	    public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

	    public void Solve()
	    {
	    	/*
	        String[] input = Console.ReadLine().Split();
	        int p = int.Parse(input[2]);
	        */
	        string u = sc.Scan();
	        string n = sc.Scan();
	        int k = sc.Integer();

	        long ans = calc(ref n, k);
	        ans = (ans - calc(ref u, k) + MOD) % MOD;

	        int b=0;
	        int c=0;
	        int d=0;
	        int sz = u.Length;
	        for(int i=0;i<sz; i++){
				int z = ((int)u[i]) - ((int)'0');
				b = (b+z)%3;
				c = c|(z==3?1:0);
				d = (d*10+z)%k;
	        }
	        if((b==0 || c==1) && d != 0){
	        	ans = (ans+1)%MOD;
	        }

	        Console.WriteLine(ans);
	    }

	    static int Main()
	    {
	        var solver = new Solver();
	        solver.Solve();
	        return 0;
	    }
	}
}


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