結果

問題 No.492 IOI数列
ユーザー tenten
提出日時 2023-04-06 09:28:49
言語 Java
(openjdk 23)
結果
RE  
実行時間 -
コード長 2,694 bytes
コンパイル時間 2,529 ms
コンパイル使用メモリ 88,756 KB
実行使用メモリ 52,296 KB
最終ジャッジ日時 2024-10-02 09:57:54
合計ジャッジ時間 4,586 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12 RE * 7
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
static final int MOD = 1000000007;
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
long n = sc.nextInt();
long[] ioi = new long[11];
for (int i = 1; i < 11; i++) {
ioi[i] = ioi[i - 1] * 100 + 1;
}
long ans2 = ioi[(int)(n % 11)];
long[][][] matrix = new long[60][3][3];
matrix[0] = new long[][]{{0, 1, 0}, {0, 100, 1}, {0, 0, 1}};
for (int i = 1; i < 60; i++) {
for (int a = 0; a < 3; a++) {
for (int b = 0; b < 3; b++) {
for (int c = 0; c < 3; c++) {
matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c] % MOD;
matrix[i][a][c] %= MOD;
}
}
}
}
long[] ans = new long[]{0, 1, 1};
for (int i = 59; i >= 0; i--) {
if (n < (1L << i)) {
continue;
}
n -= (1L << i);
long[] next = new long[3];
for (int a = 0; a < 3; a++) {
for (int b = 0; b < 3; b++) {
next[a] += matrix[i][a][b] * ans[b] % MOD;
next[a] %= MOD;
}
}
ans = next;
}
System.out.println(ans[0]);
System.out.println(ans2);
}
}
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