結果

問題 No.2017 Mod7 Parade
ユーザー tenten
提出日時 2024-04-02 15:10:04
言語 Java
(openjdk 23)
結果
AC  
実行時間 754 ms / 2,000 ms
コード長 2,485 bytes
コンパイル時間 2,125 ms
コンパイル使用メモリ 78,272 KB
実行使用メモリ 61,836 KB
最終ジャッジ日時 2024-09-30 23:14:15
合計ジャッジ時間 13,620 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
public class Main {
static final int MOD = 1000000007;
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int[] counts = new int[7];
counts[0] = 1;
while (n-- > 0) {
int d = sc.nextInt() % 7;
int length = sc.nextInt();
int v = getLength(d, length);
int w = pow(3, length);
int[] current = new int[7];
for (int i = 0; i < 7; i++) {
int idx = (i * w + v) % 7;
current[idx] += counts[i];
current[idx] %= MOD;
}
for (int i = 0; i < 7; i++) {
counts[i] += current[i];
counts[i] %= MOD;
}
}
long ans = 0;
for (int i = 1; i < 7; i++) {
ans += (long)i * counts[i] % MOD;
ans %= MOD;
}
System.out.println(ans);
}
static int getLength(int d, int length) {
if (length == 1) {
return d;
} else if (length % 2 == 0) {
int tmp = getLength(d, length / 2);
return (tmp * pow(3, length / 2) + tmp) % 7;
} else {
return (getLength(d, length - 1) * 10 + d) % 7;
}
}
static int pow(int x, int p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
return pow(x * x % 7, p / 2);
} else {
return pow(x, p - 1) * x % 7;
}
}
}
class Scanner {
BufferedReader br;
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() {
try {
br = new BufferedReader(new InputStreamReader(System.in));
} catch (Exception e) {
}
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String next() {
try {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
} catch (Exception e) {
e.printStackTrace();
} finally {
return st.nextToken();
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0