結果

問題 No.167 N^M mod 10
ユーザー Tsukasa_Type
提出日時 2018-03-10 23:22:19
言語 Java
(openjdk 23)
結果
AC  
実行時間 171 ms / 1,000 ms
コード長 2,094 bytes
コンパイル時間 2,504 ms
コンパイル使用メモリ 77,532 KB
実行使用メモリ 39,432 KB
最終ジャッジ日時 2024-09-22 01:45:10
合計ジャッジ時間 5,778 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import static java.lang.System.*;
import java.math.*;
public class Main {
    static FastScanner sc = new FastScanner(System.in);
    public static void main(String[] args) {
        BigInteger n = new BigInteger(sc.next());
        BigInteger m = new BigInteger(sc.next());
        out.println(n.modPow(m,BigInteger.TEN));
    }
}
class FastScanner implements Closeable {
    private final InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {this.in = in;}
    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;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
    public void close() {
        try {in.close();}
        catch (IOException e) {}
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0