結果
| 問題 |
No.109 N! mod M
|
| コンテスト | |
| ユーザー |
 Grenache
|
| 提出日時 | 2017-01-05 12:51:19 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 3,129 ms / 5,000 ms |
| コード長 | 6,013 bytes |
| コンパイル時間 | 3,975 ms |
| コンパイル使用メモリ | 80,680 KB |
| 実行使用メモリ | 53,368 KB |
| 最終ジャッジ日時 | 2024-06-22 05:03:22 |
| 合計ジャッジ時間 | 8,488 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 9 |
ソースコード
import java.io.*;
import java.util.*;
public class Main_yukicoder109 {
private static Scanner sc;
private static Printer pr;
private static void solve() {
int t = sc.nextInt();
for (int tcase = 0; tcase < t; tcase++) {
int n = sc.nextInt();
int m = sc.nextInt();
if (m == 1 || n >= m) {
pr.println(0);
continue;
}
if (m > 200_000) {
if (Prime.isPrime((long)m)) {
long ret = m - 1;
for (int i = m - 1; i > n; i--) {
ret = ret * inv(i, m) % m;
}
pr.println(ret);
} else {
pr.println(0);
}
} else {
long ret = 1;
for (int i = 1; i <= n; i++) {
ret = ret * i % m;
}
pr.println(ret);
}
}
}
private static int inv(int i, int mod) {
int loop = mod - 2;
long x = i;
long ret = 1;
while (loop > 0) {
if (loop % 2 == 1) {
ret = ret * x % mod;
}
x = x * x % mod;
loop /= 2;
}
return (int)ret;
}
@SuppressWarnings("unused")
private static class Prime {
private int n;
private List<Integer> primes;
private BitSet p;
Prime(int n) {
this.n = n;
p = new BitSet(n / 2);
int m = (int)Math.sqrt(n);
// for (int i = 1; i <= m; i++) {
for (int bi = p.nextClearBit(0); 2 * (bi + 1) + 1 <= m; bi = p.nextClearBit(bi + 1)) {
long i = bi + 1;
// if (p.get(i - 1)) {
// continue;
// }
for (long j = 2 * i * (i + 1); 2 * j + 1 <= n; j += 2 * i + 1) {
p.set((int)(j - 1));
}
}
}
boolean isPrime(int n) {
if (n == 2) {
return true;
}
if (n == 1 || (n & 0x1) == 0) {
return false;
}
return !p.get(n / 2 - 1);
}
List<Integer> getPrimeList() {
if (primes != null) {
return primes;
}
primes = new ArrayList<>();
if (n >= 2) {
primes.add(2);
// for (int i = 1; 2 * i + 1 <= n; i++) {
for (int bi = p.nextClearBit(0); 2 * (bi + 1) + 1 <= n; bi = p.nextClearBit(bi + 1)) {
int i = bi + 1;
// if (!p.get(i - 1)) {
// primes.add(2 * i + 1);
// }
primes.add(2 * i + 1);
}
}
return primes;
}
private static boolean isPrime(long n) {
if (n == 2) {
return true;
}
if (n == 1 || (n & 0x1) == 0) {
return false;
}
for (long i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
// ---------------------------------------------------
public static void main(String[] args) {
sc = new Scanner(System.in);
pr = new Printer(System.out);
solve();
pr.close();
sc.close();
}
@SuppressWarnings("unused")
private static class Scanner {
BufferedReader br;
Scanner (InputStream in) {
br = new BufferedReader(new InputStreamReader(in));
}
private boolean isPrintable(int ch) {
return ch >= '!' && ch <= '~';
}
private boolean isCRLF(int ch) {
return ch == '\n' || ch == '\r' || ch == -1;
}
private int nextPrintable() {
try {
int ch;
while (!isPrintable(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
return ch;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
String next() {
try {
int ch = nextPrintable();
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (isPrintable(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
int nextInt() {
try {
// parseInt from Integer.parseInt()
boolean negative = false;
int res = 0;
int limit = -Integer.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Integer.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
int multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
long nextLong() {
try {
// parseLong from Long.parseLong()
boolean negative = false;
long res = 0;
long limit = -Long.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Long.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
long multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
float nextFloat() {
return Float.parseFloat(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
try {
int ch;
while (isCRLF(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (!isCRLF(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
void close() {
try {
br.close();
} catch (IOException e) {
// throw new NoSuchElementException();
}
}
}
private static class Printer extends PrintWriter {
Printer(PrintStream out) {
super(out);
}
}
}