結果

問題 No.2017 Mod7 Parade
ユーザー tenten
提出日時 2023-07-24 18:31:52
言語 Java
(openjdk 23)
結果
AC  
実行時間 654 ms / 2,000 ms
コード長 2,781 bytes
コンパイル時間 3,019 ms
コンパイル使用メモリ 91,232 KB
実行使用メモリ 47,116 KB
最終ジャッジ日時 2024-10-01 13:45:25
合計ジャッジ時間 12,843 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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();
int n = sc.nextInt();
int[] counts = new int[7];
counts[0] = 1;
while (n-- > 0) {
int d = sc.nextInt();
int length = sc.nextInt();
int x = getLength(d, length);
int by = pow(10, length);
int[] next = new int[7];
for (int i = 0; i < 7; i++) {
next[(i * by + x) % 7] += counts[i];
next[(i * by + x) % 7] %= MOD;
}
for (int i = 0; i < 7; i++) {
counts[i] += next[i];
counts[i] %= MOD;
}
}
long ans = 0;
for (int i = 1; i < 7; i++) {
ans += (long)counts[i] * i;
ans %= MOD;
}
System.out.println(ans);
}
static int getLength(int x, int len) {
if (len == 1) {
return x % 7;
} else if (len % 2 == 0) {
int tmp = getLength(x, len / 2);
return (tmp * pow(10, len / 2) + tmp) % 7;
} else {
return (getLength(x, len - 1) * 10 + x) % 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 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