#771150 (C#(csc)) No.1973 Divisor Sequence

提出ソース

結果

問題	No.1973 Divisor Sequence
ユーザー	fgwiebfaoish
提出日時	2022-06-14 22:06:20
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	51 ms / 2,000 ms
コード長	8,787 bytes
コンパイル時間	2,393 ms
コンパイル使用メモリ	114,304 KB
実行使用メモリ	19,584 KB
最終ジャッジ日時	2024-10-03 01:02:01
合計ジャッジ時間	4,272 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

ファイルパターン	結果
sample	AC * 3
other	AC * 22

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
//using nint=System.Int32;
static class Program{
	const long inf=long.MaxValue>>1;
	const int mod=(int)1e9+7;
	static Sc sc=new Sc();
	static void Main(){
		Pt pt=new Pt(Solve);
		pt.Sm();
	}
	static void Solve(Pt pt) {
		var (n,m)=sc.Tp2<int,long>();
		var pf=new Pf(m);
		long ans=1;
		pf.Get((k,v)=>{
			var g=new long[v+1][];
			for(int i = 0;i <= v;i++) {
				g[i]=new long[v+1];
				for(int j = 0;j <= v-i;j++) {g[i][j]=1;}
			}
			var b=Enumerable.Repeat(1L,v+1).ToArray();
			ans=Mp(b,g,n-1).Sum()%mod*ans%mod;
		});
		pt.Wl(ans);
	}
	static long[] Mp(long[] r,long[][] x,long e){
		while(e>0){
			if((e&1)>0){r=Mm(x,r);}
			x=Mm(x,x);
			e>>=1;
		}
		return r;
	}
	static long[] Mm(long[][] a,long[] b){
		var q=new long[b.Length];
		for(int j=0;j<a.Length;j++){
			for(int k=0;k<a.Length;k++){q[j]=(q[j]+a[j][k]*b[k])%mod;}
		}
		return q;
	}
	static long[][] Mm(long[][] a,long[][] b){
		var q=new long[a.Length][];
		for(int j=0;j<a.Length;j++){
			q[j]=new long[b[0].Length];
			for(int i=0;i<b[0].Length;i++){
				for(int k=0;k<a.Length;k++){q[j][i]=(q[j][i]+a[j][k]*b[k][i])%mod;}
			}
		}
		return q;
	}
}
public class Pf{
	public Dictionary<long,int> hs=new Dictionary<long,int>();
	public Pf(long n){
		if(n%2==0){
			int p=0;
			while((n&1)==0){n>>=1;p++;}
			hs.Add(2,p);
		}
		var q=(int)Sqrt(n)+1;
		for(int i=3;n!=1&&i<q;i+=2){
			if(n%i==0){
				int p=0;
				while(n%i==0){n/=i;p++;}
				q=(int)Sqrt(n)+1;
				hs.Add(i,p);
			}
		}
		if(n!=1){hs.Add(n,1);}
	}
	public void Get(Action<long,int> f){
		foreach(var e in hs){f(e.Key,e.Value);}
	}
}
public class Pt{
	private StringBuilder sb=new StringBuilder();
	public Pt(Action<Pt> f){f(this);}
	public void W(int s){sb.Append(s);}
	public void W(long s){sb.Append(s);}
	public void W(double s){sb.Append(s);}
	public void W(decimal s){sb.Append(s);}
	public void W(char s){sb.Append(s);}
	public void W(string s){sb.Append(s);}
	public void W(object s){sb.Append(s);}
	public void W(string f,int s){sb.Append(s.ToString(f));}
	public void W(string f,long s){sb.Append(s.ToString(f));}
	public void W(string f,double s){sb.Append(s.ToString(f));}
	public void W(string f,decimal s){sb.Append(s.ToString(f));}
	public void Wl(int s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(long s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(double s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(decimal s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(char s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(object s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string f,int s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,long s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,double s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,decimal s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(int[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(long[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(double[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(string[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(object[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(){sb.Append(Environment.NewLine);}
	public void Sm(){Console.Write(sb);}
	public static bool operator==(Pt a,Pt b){return a.sb.ToString()==b.sb.ToString();}
	public static bool operator!=(Pt a,Pt b){return a.sb.ToString()!=b.sb.ToString();}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
}
public class Sc{
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string Rl(){return Console.ReadLine();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string[] Sp(string st){return st.Split();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
	public virtual int I{get{return int.Parse(Rl());}}
	public virtual long L{get{return long.Parse(Rl());}}
	public virtual double D{get{return double.Parse(Rl());}}
	public virtual string S{get{return Rl();}}
	public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}}
	public string[] Sa{get{return Sp(Rl());}}
	public object[] Oa{get{return Sp(Rl());}}
	public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),double.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(Sp(Rl()));}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,Sp(Rl()));}return a;}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
}
public class Scr:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	private bool bo=false;
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){
		if(bo){return li[l++%li.Count];}
		li.Add(Console.ReadLine());
		return li[li.Count-1];
	}
	public void Again(){bo=true;}
}
public class Sc2:Sc{
	private string[] sps=new string[]{" ","　","\t"};
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);}
	public override int I{get{return int.Parse(Sp(Rl())[0]);}}
	public override long L{get{return long.Parse(Sp(Rl())[0]);}}
	public override double D{get{return double.Parse(Sp(Rl())[0]);}}
	public override string S{get{return Sp(Rl())[0];}}
}
public class Sct:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	public void Add(int s){li.Add(s.ToString());}
	public void Add(long s){li.Add(s.ToString());}
	public void Add(double s){li.Add(s.ToString());}
	public void Add(string s){li.Add(s.ToString());}
	public void Add(object s){li.Add(s.ToString());}
	public void Add(int[] s){li.Add(string.Join(" ",s));}
	public void Add(long[] s){li.Add(string.Join(" ",s));}
	public void Add(double[] s){li.Add(string.Join(" ",s));}
	public void Add(string[] s){li.Add(string.Join(" ",s));}
	public void Add(object[] s){li.Add(string.Join(" ",s));}
	protected override string Rl(){return li[l++];}
	public void Clear(){li.Clear();l=0;}
	public void Again(){l=0;}
	public void Pf(){Console.WriteLine(string.Join("\n",li));}
}

yukicoder

結果

コンパイルメッセージ

ソースコード