結果

問題 No.523 LED
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-06-02 22:57:51
言語 Java
(openjdk 23)
結果
AC  
実行時間 405 ms / 2,000 ms
コード長 2,901 bytes
コンパイル時間 2,327 ms
コンパイル使用メモリ 77,588 KB
実行使用メモリ 37,376 KB
最終ジャッジ日時 2024-09-21 23:54:44
合計ジャッジ時間 6,485 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
36,336 KB
testcase_01 AC 53 ms
36,572 KB
testcase_02 AC 65 ms
36,464 KB
testcase_03 AC 53 ms
36,320 KB
testcase_04 AC 51 ms
36,432 KB
testcase_05 AC 403 ms
37,184 KB
testcase_06 AC 52 ms
36,560 KB
testcase_07 AC 52 ms
36,760 KB
testcase_08 AC 52 ms
36,420 KB
testcase_09 AC 58 ms
36,408 KB
testcase_10 AC 53 ms
36,432 KB
testcase_11 AC 52 ms
36,492 KB
testcase_12 AC 50 ms
36,640 KB
testcase_13 AC 127 ms
37,104 KB
testcase_14 AC 51 ms
36,544 KB
testcase_15 AC 53 ms
36,420 KB
testcase_16 AC 52 ms
36,656 KB
testcase_17 AC 52 ms
36,732 KB
testcase_18 AC 405 ms
37,144 KB
testcase_19 AC 186 ms
37,376 KB
testcase_20 AC 173 ms
37,228 KB
testcase_21 AC 322 ms
37,224 KB
testcase_22 AC 354 ms
37,240 KB
testcase_23 AC 351 ms
37,232 KB
testcase_24 AC 65 ms
36,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int N = sc.nextInt();
long mod = 1000000007;
long ret = 1;
for (int i = 0; i < N; i ++) {
ret = ret * (i * 2 + 1);
ret %= mod;
ret = ret * (i * 2 + 2) / 2 % mod;
}
System.out.println(ret);
}
}
class FastScanner {
public static String debug = null;
private final InputStream in = System.in;
private int ptr = 0;
private int buflen = 0;
private byte[] buffer = new byte[1024];
private boolean eos = false;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
if (debug != null) {
buflen = debug.length();
buffer = debug.getBytes();
debug = "";
eos = true;
} else {
buflen = in.read(buffer);
}
} catch (IOException e) {
e.printStackTrace();
}
if (buflen < 0) {
eos = true;
return false;
} else 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 void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
}
public boolean isEOS() {
return this.eos;
}
public boolean hasNext() {
skipUnprintable();
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 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() {
return (int) nextLong();
}
public long[] nextLongList(int n) {
return nextLongTable(1, n)[0];
}
public int[] nextIntList(int n) {
return nextIntTable(1, n)[0];
}
public long[][] nextLongTable(int n, int m) {
long[][] ret = new long[n][m];
for (int i = 0; i < n; i ++) {
for (int j = 0; j < m; j ++) {
ret[i][j] = nextLong();
}
}
return ret;
}
public int[][] nextIntTable(int n, int m) {
int[][] ret = new int[n][m];
for (int i = 0; i < n; i ++) {
for (int j = 0; j < m; j ++) {
ret[i][j] = nextInt();
}
}
return ret;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0