結果

問題 No.534 フィボナッチフィボナッチ数
ユーザー tenten
提出日時 2023-07-28 10:06:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 3,578 bytes
コンパイル時間 2,631 ms
コンパイル使用メモリ 92,172 KB
実行使用メモリ 37,280 KB
最終ジャッジ日時 2024-10-05 21:32:29
合計ジャッジ時間 6,219 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
static final int MOD1 = 1000000007;
static final int MOD2 = 2000000016;
static HashMap<Integer, Integer> dp = new HashMap<>();
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
long n = sc.nextLong();
long[][][] matrix2 = new long[60][2][2];
matrix2[0] = new long[][]{{0, 1}, {1, 1}};
for (int i = 1; i < 60; i++) {
for (int a = 0; a < 2; a++) {
for (int b = 0; b < 2; b++) {
for (int c = 0; c < 2; c++) {
matrix2[i][a][c] += matrix2[i - 1][a][b] * matrix2[i - 1][b][c] % MOD2;
matrix2[i][a][c] %= MOD2;
}
}
}
}
long[] ans2 = new long[]{0, 1};
for (int i = 59; i >= 0; i--) {
if (n < (1L << i)) {
continue;
}
n -= (1L << i);
long[] next = new long[2];
for (int a = 0; a < 2; a++) {
for (int b = 0; b < 2; b++) {
next[a] += matrix2[i][a][b] * ans2[b] % MOD2;
next[a] %= MOD2;
}
}
ans2 = next;
}
long k = ans2[0];
long[][][] matrix1 = new long[40][2][2];
matrix1[0] = new long[][]{{0, 1}, {1, 1}};
for (int i = 1; i < 40; i++) {
for (int a = 0; a < 2; a++) {
for (int b = 0; b < 2; b++) {
for (int c = 0; c < 2; c++) {
matrix1[i][a][c] += matrix1[i - 1][a][b] * matrix1[i - 1][b][c] % MOD1;
matrix1[i][a][c] %= MOD1;
}
}
}
}
long[] ans1 = new long[]{0, 1};
for (int i = 39; i >= 0; i--) {
if (k < (1L << i)) {
continue;
}
k -= (1L << i);
long[] next = new long[2];
for (int a = 0; a < 2; a++) {
for (int b = 0; b < 2; b++) {
next[a] += matrix1[i][a][b] * ans1[b] % MOD1;
next[a] %= MOD1;
}
}
ans1 = next;
}
System.out.println(ans1[0]);
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0