結果

問題 No.1595 The Final Digit
ユーザー nishi5451nishi5451
提出日時 2021-08-02 17:44:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 2,000 ms
コード長 3,406 bytes
コンパイル時間 2,381 ms
コンパイル使用メモリ 78,392 KB
実行使用メモリ 37,080 KB
最終ジャッジ日時 2024-09-16 14:40:10
合計ジャッジ時間 4,228 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,848 KB
testcase_01 AC 53 ms
36,540 KB
testcase_02 AC 55 ms
36,760 KB
testcase_03 AC 53 ms
37,080 KB
testcase_04 AC 54 ms
36,788 KB
testcase_05 AC 53 ms
36,792 KB
testcase_06 AC 53 ms
36,564 KB
testcase_07 AC 54 ms
36,968 KB
testcase_08 AC 52 ms
36,824 KB
testcase_09 AC 54 ms
37,072 KB
testcase_10 AC 53 ms
36,932 KB
testcase_11 AC 53 ms
36,716 KB
testcase_12 AC 52 ms
36,984 KB
testcase_13 AC 52 ms
36,564 KB
testcase_14 AC 51 ms
36,940 KB
testcase_15 AC 53 ms
36,816 KB
testcase_16 AC 53 ms
36,852 KB
testcase_17 AC 54 ms
36,772 KB
testcase_18 AC 53 ms
36,932 KB
testcase_19 AC 53 ms
36,520 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	static long[][] matPow(long[][] mat, long p){
		int n = mat.length;
		long[][] ret = new long[n][n];
		for(int i = 0; i < n; i++) ret[i][i] = 1;
		long[][] pow = new long[n][n];
		for(int i = 0; i < n; i++) pow[i] = mat[i].clone();
		while(p > 0){
			if((p&1) == 1){
				ret = matMul(pow, ret);
			}
			pow = matMul(pow, pow);
			p >>= 1;
		}
		return ret;
	}
	static long[][] matMul(long[][] a, long[][] b){
		int h = a.length;
		int k = b.length;
		int w = b[0].length;
		long[][] ret = new long[h][w];
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				for(int ij = 0; ij < k; ij++){
					ret[i][j] += (a[i][ij]*b[ij][j]);
					ret[i][j] %= 10;
				}
			}
		}
		return ret;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		// [1 1 1     [p    [p+q+r
		//  1 0 0  *   q  =  p 
		//  0 1 0]     r]    q]
		long p = fs.nextLong();
		long q = fs.nextLong();
		long r = fs.nextLong();
		long k = fs.nextLong();
		long[][] mat = {{1,1,1},{1,0,0},{0,1,0}};
		long[][] now = matPow(mat, k-3);
		long[][] source = {{r},{q},{p}};
		long[][] ans  = matMul(now,source);
		pw.println(ans[0][0]);
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0