結果

問題 No.741 AscNumber(Easy)
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2020-01-19 20:23:57
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,888 ms / 2,000 ms
コード長 3,641 bytes
コンパイル時間 2,679 ms
コンパイル使用メモリ 113,920 KB
実行使用メモリ 185,236 KB
最終ジャッジ日時 2024-07-02 22:08:09
合計ジャッジ時間 29,522 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 55
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
const int mod=(int)1e9+7;
static void Main(){
Sc sc=new Sc();
var m=sc.I;
string s="1"+new string('0',m);
int n=s.Length;
Mint ans=0;
var dp=new Mint[n+1,2,10];
dp[0,0,0]=1;
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
for(int k=0;k<10;k++){
int lm=j==0?s[i]-'0':9;
for(int d=k;d<=lm;d++){dp[i+1,(j==1||d<lm)?1:0,d]+=dp[i,j,k];}
}
}
}
for(int k = 0;k<10;k++) {ans+=dp[n,1,k];}
Console.WriteLine("{0}",ans);
}
}
public struct Mint{
const int mod=(int)1e9+7;
private long d;
public Mint(long d){this.d=d;}
public static implicit operator Mint(long d){return new Mint(d%mod);}
public static explicit operator long(Mint d){return d.d;}
public override string ToString(){return d.ToString();}
public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;}
public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;}
public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;}
public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;}
public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;}
public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;}
private static long Mi(long a){
a=(a+mod)%mod;
long b=mod,u=1,v=0;
while(b>0){
long t=a/b;
a-=t*b;a^=b;b^=a;a^=b;
u-=t*v;u^=v;v^=u;u^=v;
}
u%=mod;
if(u<0){u+=mod;}
return u%mod;
}
}
public class Sc{
public int I{get{return int.Parse(Console.ReadLine());}}
public long L{get{return long.Parse(Console.ReadLine());}}
public double D{get{return double.Parse(Console.ReadLine());}}
public string S{get{return Console.ReadLine();}}
public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
public string[] Sa{get{return Console.ReadLine().Split();}}
public object[] Oa{get{return Console.ReadLine().Split();}}
public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),int.Parse);}
public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),long.Parse);}
public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
public T[] Arr<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;}
public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0