結果
問題 | No.718 行列のできるフィボナッチ数列道場 (1) |
ユーザー | hiromi_ayase |
提出日時 | 2018-07-27 23:48:23 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 3,702 bytes |
コンパイル時間 | 2,626 ms |
コンパイル使用メモリ | 83,424 KB |
実行使用メモリ | 52,824 KB |
最終ジャッジ日時 | 2023-09-18 15:26:39 |
合計ジャッジ時間 | 5,223 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
50,828 KB |
testcase_01 | AC | 71 ms
50,704 KB |
testcase_02 | AC | 71 ms
50,960 KB |
testcase_03 | AC | 70 ms
50,832 KB |
testcase_04 | AC | 70 ms
50,748 KB |
testcase_05 | AC | 69 ms
51,120 KB |
testcase_06 | AC | 70 ms
50,704 KB |
testcase_07 | AC | 71 ms
50,796 KB |
testcase_08 | AC | 72 ms
51,076 KB |
testcase_09 | AC | 71 ms
51,000 KB |
testcase_10 | AC | 71 ms
50,836 KB |
testcase_11 | AC | 72 ms
50,680 KB |
testcase_12 | AC | 72 ms
52,824 KB |
testcase_13 | AC | 71 ms
50,944 KB |
testcase_14 | AC | 71 ms
50,836 KB |
testcase_15 | AC | 72 ms
50,780 KB |
testcase_16 | AC | 72 ms
50,836 KB |
testcase_17 | AC | 72 ms
50,860 KB |
testcase_18 | AC | 71 ms
51,000 KB |
testcase_19 | AC | 71 ms
50,776 KB |
testcase_20 | AC | 72 ms
50,928 KB |
testcase_21 | AC | 70 ms
50,792 KB |
testcase_22 | AC | 70 ms
51,000 KB |
ソースコード
public class Main { private static void solve() { long n = nl(); int[][] a = {{1, 1}, {1, 0}}; int[] v = {1, 0}; int mod = 1000000000 + 7; long x = pow(a, v, n, mod)[0]; long y = pow(a, v, n - 1, mod)[0]; System.out.println(x * y % mod); } 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; } 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)); } }