結果
問題 | No.167 N^M mod 10 |
ユーザー | uwi |
提出日時 | 2015-03-19 23:25:30 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,056 bytes |
コンパイル時間 | 3,296 ms |
コンパイル使用メモリ | 84,960 KB |
実行使用メモリ | 50,500 KB |
最終ジャッジ日時 | 2024-06-28 23:16:46 |
合計ジャッジ時間 | 5,673 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | AC | 56 ms
37,164 KB |
testcase_03 | AC | 56 ms
36,824 KB |
testcase_04 | WA | - |
testcase_05 | AC | 48 ms
37,028 KB |
testcase_06 | WA | - |
testcase_07 | AC | 47 ms
36,788 KB |
testcase_08 | AC | 48 ms
36,676 KB |
testcase_09 | AC | 48 ms
36,844 KB |
testcase_10 | WA | - |
testcase_11 | AC | 48 ms
36,804 KB |
testcase_12 | AC | 47 ms
36,700 KB |
testcase_13 | WA | - |
testcase_14 | AC | 46 ms
36,888 KB |
testcase_15 | AC | 46 ms
36,920 KB |
testcase_16 | AC | 47 ms
36,788 KB |
testcase_17 | AC | 48 ms
36,920 KB |
testcase_18 | AC | 48 ms
37,048 KB |
testcase_19 | AC | 48 ms
36,700 KB |
testcase_20 | AC | 48 ms
36,620 KB |
testcase_21 | AC | 46 ms
36,732 KB |
testcase_22 | AC | 53 ms
37,264 KB |
testcase_23 | AC | 57 ms
36,952 KB |
testcase_24 | AC | 57 ms
37,192 KB |
testcase_25 | AC | 57 ms
37,172 KB |
testcase_26 | AC | 51 ms
37,096 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
ソースコード
package q3xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q373 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] n = ns().toCharArray(); char[] m = ns().toCharArray(); int L = n[n.length-1]-'0'; int mm = (m[m.length-1]-'0') + (m.length-2 >= 0 ? (m[m.length-2]-'0')*10 : 0); mm %= 4; long ret = 1; for(int i = 0;i < mm;i++){ ret = ret * L % 10; } out.println(ret); } 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 Q373().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)); } }