結果
問題 | No.251 大きな桁の復習問題(1) |
ユーザー | uwi |
提出日時 | 2015-07-24 22:34:15 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 647 ms / 5,000 ms |
コード長 | 2,963 bytes |
コンパイル時間 | 4,925 ms |
コンパイル使用メモリ | 86,744 KB |
実行使用メモリ | 55,548 KB |
最終ジャッジ日時 | 2023-08-22 16:46:56 |
合計ジャッジ時間 | 13,081 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,576 KB |
testcase_01 | AC | 43 ms
49,512 KB |
testcase_02 | AC | 46 ms
48,384 KB |
testcase_03 | AC | 46 ms
50,324 KB |
testcase_04 | AC | 44 ms
49,528 KB |
testcase_05 | AC | 42 ms
49,248 KB |
testcase_06 | AC | 43 ms
49,508 KB |
testcase_07 | AC | 43 ms
49,068 KB |
testcase_08 | AC | 43 ms
49,224 KB |
testcase_09 | AC | 623 ms
55,088 KB |
testcase_10 | AC | 644 ms
55,212 KB |
testcase_11 | AC | 647 ms
55,164 KB |
testcase_12 | AC | 632 ms
55,272 KB |
testcase_13 | AC | 622 ms
55,152 KB |
testcase_14 | AC | 623 ms
55,032 KB |
testcase_15 | AC | 628 ms
55,048 KB |
testcase_16 | AC | 633 ms
55,272 KB |
testcase_17 | AC | 631 ms
55,192 KB |
testcase_18 | AC | 634 ms
55,216 KB |
testcase_19 | AC | 632 ms
55,548 KB |
testcase_20 | AC | 44 ms
49,440 KB |
testcase_21 | AC | 44 ms
49,372 KB |
testcase_22 | AC | 44 ms
49,480 KB |
testcase_23 | AC | 44 ms
49,628 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigInteger; import java.util.Arrays; import java.util.InputMismatchException; public class Q392 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int mod = 129402307; BigInteger n = new BigInteger(ns()); BigInteger m = new BigInteger(ns()); out.println(n.modPow(m, BigInteger.valueOf(mod))); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q392().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }