結果
| 問題 | No.117 組み合わせの数 |
| ユーザー |
 ひばち
|
| 提出日時 | 2019-08-16 19:01:05 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,230 bytes |
| コンパイル時間 | 1,060 ms |
| コンパイル使用メモリ | 118,648 KB |
| 実行使用メモリ | 75,140 KB |
| 最終ジャッジ日時 | 2024-09-22 12:11:25 |
| 合計ジャッジ時間 | 2,401 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Convert;
using static System.Math;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{
private static void chmin<T>(ref T num, T val) where T : IComparable<T>
=> num = num.CompareTo(val) == 1 ? val : num;
private static void chmax<T>(ref T num, T val) where T : IComparable<T>
=> num = num.CompareTo(val) == -1 ? val : num;
static void Main(string[] args)
{
var pr = new Program();
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
pr.Solve();
Console.Out.Flush();
}
void Solve()
{
var t = Input.num;
ModInt.CombBuild(2*(int)1e6 + 100);
while (t-- > 0)
{
var str = ReadLine().Split(',');
var n = int.Parse(str[0].Substring(2));
var k = int.Parse(str[1].Substring(0, str[1].Length - 1));
if (n == 0 || k == 0) { WriteLine(0); continue; }
if (str[0][0] == 'C')
WriteLine(ModInt.Comb(n, k));
else if (str[0][0] == 'P')
WriteLine(ModInt.Part(n,k));
else WriteLine(ModInt.Comb(n + k - 1, k));
}
}
}
public class Input
{
public static string read => ReadLine().Trim();
public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
public static int num => ToInt32(read);
public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
public static long numL => ToInt64(read);
public static T[] create<T>(int n, Func<int, T> f)
=> Enumerable.Repeat(0, n).Select(f).ToArray();
public static char[][] gred(int h)
=> create(h, _ => read.ToCharArray());
public static int[] ar1D(int n)
=> create(n, _ => num);
public static long[] arL1D(int n)
=> create(n, _ => numL);
public static string[] strs(int n)
=> create(n, _ => read);
public static int[][] ar2D(int n)
=> create(n, _ => ar);
public static long[][] arL2D(int n)
=> create(n, _ => arL);
public static List<T>[] edge<T>(int n)
=> create(n, _ => new List<T>());
public static T GetValue<T>(string g)
{
var t = typeof(T);
if (t == typeof(int))
return (T)(object)int.Parse(g);
if (t == typeof(long))
return (T)(object)long.Parse(g);
if (t == typeof(string))
return (T)(object)g;
if (t == typeof(char))
return (T)(object)char.Parse(g);
if (t == typeof(double))
return (T)(object)double.Parse(g);
if (t == typeof(bool))
return (T)(object)bool.Parse(g);
return default(T);
}
public static void Make<T1, T2>(out T1 v1, out T2 v2)
{
v1 = Next<T1>();
v2 = Next<T2>();
}
public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
{
Make(out v1, out v2);
v3 = Next<T3>();
}
public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4)
{
Make(out v1, out v2, out v3);
v4 = Next<T4>();
}
public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5)
{
Make(out v1, out v2, out v3, out v4);
v5 = Next<T5>();
}
public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6)
{
Make(out v1, out v2, out v3, out v4, out v5);
v6 = Next<T6>();
}
private static Queue<string> sc;
public static T Next<T>(){ sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item);return GetValue<T>(sc.Dequeue()); }
public static void Next<T>(ref T val) => val = Next<T>();
public const long Inf = (long)1e18;
public const double eps = 1e-6;
public const string Alfa = "abcdefghijklmnopqrstuvwxyz";
public const int MOD = 1000000007;
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
public T1 v1 { get; set; }
public T2 v2 { get; set; }
public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }
public Pair(T1 v1, T2 v2)
{ this.v1 = v1; this.v2 = v2; }
public int CompareTo(Pair<T1, T2> p)
{
var c = Comparer<T1>.Default.Compare(v1, p.v1);
if (c == 0)
c = Comparer<T2>.Default.Compare(v2, p.v2);
return c;
}
public override string ToString()
=> $"{v1.ToString()} {v2.ToString()}";
public override bool Equals(object obj)
=> this == (Pair<T1, T2>)obj;
public override int GetHashCode()
=> v1.GetHashCode() ^ v2.GetHashCode();
public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == 0;
public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != 0;
public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == 1;
public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != -1;
public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == -1;
public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != 1;
}
public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
public T3 v3 { get; set; }
public Pair() : base() { v3 = Input.Next<T3>(); }
public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
{ this.v3 = v3; }
public int CompareTo(Pair<T1, T2, T3> p)
{
var c = base.CompareTo(p);
if (c == 0)
c = Comparer<T3>.Default.Compare(v3, p.v3);
return c;
}
public override string ToString()
=> $"{base.ToString()} {v3.ToString()}";
}
public struct ModInt
{
public const long MOD = (int)1e9 + 7;
//public const long MOD = 998244353;
public long num { get; set; }
public ModInt(long n = 0) { num = n; }
private static ModInt[] _fac;//階乗
private static ModInt[] _inv;//逆数
private static ModInt[] _facrev;//1/(i!)
public override string ToString()
=> num.ToString();
public static ModInt operator +(ModInt l, ModInt r)
{
l.num += r.num;
if (l.num >= MOD) l.num -= MOD;
return l;
}
public static ModInt operator -(ModInt l, ModInt r)
{
l.num -= r.num;
if (l.num < 0) l.num += MOD;
return l;
}
public static ModInt operator *(ModInt l, ModInt r)
=> new ModInt(l.num * r.num % MOD);
public static ModInt operator /(ModInt l, ModInt r)
=> l * Pow(r, MOD - 2);
public static implicit operator long(ModInt l)
=> l.num;
public static implicit operator ModInt(long n)
{
n %= MOD; if (n < 0) n += MOD;
return new ModInt(n);
}
public static ModInt Pow(ModInt m, long n)
{
if (n == 0) return 1;
if (n % 2 == 0) return Pow(m * m, n >> 1);
else return Pow(m * m, n >> 1) * m;
}
public static void CombBuild(int n)
{
_fac = new ModInt[n + 1];
_facrev = new ModInt[n + 1];
_inv = new ModInt[n + 1];
_inv[1] = 1;
_fac[0] = _fac[1] = 1;
_facrev[0] = _facrev[1] = 1;
for (var i = 2; i <= n; i++)
{
_fac[i] = _fac[i - 1] * i;
_inv[i] = MOD - _inv[MOD % i] * (MOD / i);
_facrev[i] = _facrev[i - 1] * _inv[i];
}
}
public static ModInt Fac(ModInt n)
=> _fac[n];
public static ModInt Div(ModInt n)
=> _inv[n];
public static ModInt FacRev(ModInt n)
=> _facrev[n];
public static ModInt Part(ModInt n, ModInt r)
{
if (n < r) return 0;
return _fac[n] * _facrev[n-r];
}
public static ModInt Comb(ModInt n, ModInt r)
{
if (n < r) return 0;
if (n == r) return 1;
var calc = _fac[n];
calc = calc * _facrev[r];
calc = calc * _facrev[n - r];
return calc;
}
}