結果
| 問題 | No.117 組み合わせの数 |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-01-04 23:50:10 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 677 ms / 5,000 ms |
| コード長 | 5,137 bytes |
| コンパイル時間 | 2,333 ms |
| コンパイル使用メモリ | 78,368 KB |
| 実行使用メモリ | 70,892 KB |
| 最終ジャッジ日時 | 2024-06-13 02:25:38 |
| 合計ジャッジ時間 | 4,108 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
ソースコード
package no117;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static final long MOD = 1000000007;
public static void main(String[] args) {
long[] fact = new long[2000001];
long[] factInv = new long[1000001];
fact[0] = 1;
for(int i=1;i<=2000000;i++) {
fact[i] = (fact[i-1] * i) % MOD;
}
for(int i=0;i<=1000000;i++) {
factInv[i] = ModPow.modInv(fact[i], MOD);
}
IO io = new IO();
int n = io.nextInt();
for(int i=0;i<n;i++) {
String s = io.next();
char c = s.charAt(0);
String[] s2 = s.substring(2, s.length()-1).split(",");
int a = Integer.valueOf(s2[0]);
int b = Integer.valueOf(s2[1]);
switch (c) {
case 'C':
if (a < b) {
io.out.println("0");
continue;
}
io.out.println((((fact[a] * factInv[a-b]) % MOD) * factInv[b]) % MOD);
break;
case 'P':
if (a < b) {
io.out.println("0");
continue;
}
io.out.println((fact[a] * factInv[a-b]) % MOD);
break;
case 'H':
if (a == 0) {
if (b == 0) {
io.out.println(1);
}else{
io.out.println(0);
}
}else{
io.out.println((((fact[a+b-1] * factInv[a-1]) % MOD) * factInv[b]) % MOD);
}
break;
}
}
io.out.flush();
}
}
class ModPow {
public static long modpow(long x,long n,long mod) {
long res = 1;
while(n > 0) {
if ((n & 1) > 0) {
res = (res * x) % mod;
}
x = (x * x) % mod;
n/=2;
}
return res;
}
public static long modInv(long x,long modP) {
return modpow(x, modP-2, modP);
}
}
class IO {
private final InputStream in;
final PrintWriter out = new PrintWriter(System.out);
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { this.in = source;}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public boolean hasNextLine() { skipNewLine(); return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] nextCharArray(int len) {
char[] s = new char[len];
if (!hasNext()) {
throw new NoSuchElementException();
}
int i = 0;
int b = readByte();
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
b = readByte();
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return (char) readByte();
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
}