結果

問題 No.1595 The Final Digit
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-07-10 01:39:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 77 ms / 2,000 ms
コード長 3,619 bytes
コンパイル時間 2,506 ms
コンパイル使用メモリ 89,916 KB
実行使用メモリ 38,416 KB
最終ジャッジ日時 2024-07-01 20:33:30
合計ジャッジ時間 4,684 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
38,168 KB
testcase_01 AC 75 ms
38,076 KB
testcase_02 AC 75 ms
38,052 KB
testcase_03 AC 75 ms
37,888 KB
testcase_04 AC 75 ms
38,292 KB
testcase_05 AC 75 ms
38,416 KB
testcase_06 AC 75 ms
38,180 KB
testcase_07 AC 77 ms
38,356 KB
testcase_08 AC 75 ms
37,916 KB
testcase_09 AC 74 ms
38,204 KB
testcase_10 AC 74 ms
37,888 KB
testcase_11 AC 74 ms
38,096 KB
testcase_12 AC 75 ms
38,228 KB
testcase_13 AC 75 ms
38,256 KB
testcase_14 AC 74 ms
38,220 KB
testcase_15 AC 74 ms
38,076 KB
testcase_16 AC 74 ms
38,072 KB
testcase_17 AC 74 ms
38,144 KB
testcase_18 AC 75 ms
37,944 KB
testcase_19 AC 75 ms
38,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int p = ni();
    int q = ni();
    int r = ni();
    long k = nl();

    int[][] a = {
      {0, 1, 0},
      {0, 0, 1},
      {1, 1, 1}
    };

    int[] v = {p, q, r};

    int[] ret = pow(a, v, k - 1, 10);
    System.out.println(ret[0]);
  }

  	// A^e*v
	public static int[] pow(int[][] A, int[] v, long e, int mod)
	{
		int[][] MUL = A;
		for(int i = 0;i < v.length;i++)v[i] %= mod;
		for(;e > 0;e>>>=1) {
			if((e&1)==1)v = mul(MUL, v, mod);
			MUL = p2(MUL, mod);
		}
		return v;
	}
	
	
	// int matrix * int vector
	public static int[] mul(int[][] A, int[] v, int mod)
	{
		int m = A.length;
		int n = v.length;
		int[] w = new int[m];
		for(int i = 0;i < m;i++){
			long sum = 0;
			for(int k = 0;k < n;k++){
				sum += (long)A[i][k] * v[k];
				sum %= mod;
			}
			w[i] = (int)sum;
		}
		return w;
	}
	
	// int matrix^2 (cannot ensure negative values)
	public static int[][] p2(int[][] A, int mod)
	{
		int n = A.length;
		int[][] C = new int[n][n];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				long sum = 0;
				for(int k = 0;k < n;k++){
					sum += (long)A[i][k] * A[k][j];
					sum %= mod;
				}
				C[i][j] = (int)sum;
			}
		}
		return C;
	}

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0