結果

問題 No.1659 Product of Divisors
ユーザー fgwiebfaoish
提出日時 2021-08-27 22:04:57
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 4,596 bytes
コンパイル時間 1,320 ms
コンパイル使用メモリ 110,720 KB
実行使用メモリ 18,432 KB
最終ジャッジ日時 2024-11-21 02:28:54
合計ジャッジ時間 2,368 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
//using nint=System.Int32;
static class Program{
    const int mod=(int)1e9+7;
    static void Main(){
        Sc sc=new Sc();
        var (n,m)=sc.Tp2<long>();
        var pf=new Pf(n);
        int p=0;
        var li=new List<int>();
        pf.Get((k,v)=>{
            li.Add(v);
            p+=v;
        });
        Cb r=new Cb(100);
        long ans=1;
        for(int j = 0;j<li.Count;j++) {
            long g=0;
            for(int k = 0;k<=li[j];k++) {g+=r.C2(m+k-1,k);}
            ans=ans*g%mod;
        }
        Console.WriteLine("{0}",ans);
        //Console.WriteLine("{0}",string.Join(" ",a));
    }
}
public class Cb{
    private const int mod=(int)1e9+7;
    public long[] r,f,v;
    public Cb(int n){
        r=new long[n];
        f=new long[n];
        v=new long[n];
        r[0]=r[1]=f[0]=f[1]=v[1]=1;
        for(int i=2;i<n;i++){
            r[i]=r[i-1]*i%mod;
            v[i]=mod-v[mod%i]*(mod/i)%mod;
            f[i]=f[i-1]*v[i]%mod;
        }
    }
    public long C1(long n,long k){return r[n]*(f[k]*f[n-k]%mod)%mod;}
    public long C2(long n,long k){
        long l=1;
        n%=mod;
        for(int i=1;i<=k;i++){l=l*(n-i+1)%mod;l=l*v[i]%mod;}
        return l;
    }
    public long C3(long n,long k){return (r[n]*Mi(r[k]*r[n-k]))%mod;}
    public long P1(long n,long k){return n>=k?r[n]*Mi(r[n-k])%mod:0;}
    public 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);u-=t*v;(u,v)=(v,u);}
        u%=mod;
        if(u<0){u+=mod;}
        return u%mod;
    }
}
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 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(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}
    public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
    public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
    public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}
    public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}
    public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
    public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),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(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;}
    public (T,T) Tp2<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]));}
    public (T,T,T) Tp3<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
    public (T,T,T,T) Tp4<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
    public (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
    public (T1,T1,T2) Tp3<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
    private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0