Submission #968979


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {

    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;

    void solve() throws IOException {
        int n = ni();
        int k = ni();
        int[] a = nia(n);

        ArrayList<Pair> list = new ArrayList<>();
        int tmp = k;
        for (int i = 2; i * i <= k; i++) {
            if (tmp % i == 0) {
                int cnt = 0;
                while (tmp % i == 0) {
                    cnt++;
                    tmp /= i;
                }
                list.add(new Pair(i, cnt));
            }
        }

        int N = list.size();
        int[][] pcnt = new int[n][N];
        int z = 1;
        for (int i = 0; i < N; i++) {
            z *= list.get(i).y;
        }
        int[] gcnt = new int[z];

        for (int i = 0; i < n; i++) {
            int tmp2 = a[i];
            for (int j = 0; j < N; j++) {
                int x = list.get(i).x;
                if (tmp2 % x == 0) {
                    int cnt = 0;
                    while (tmp2 % x == 0) {
                        cnt++;
                        tmp2 /= x;
                    }
                    pcnt[i][j] = cnt;
                }
            }

            int gen = pcnt[i][0];
            int deg = 1;
            for (int j = 1; j < N; j++) {
                gen *= list.get(i).y;
                gen += pcnt[i][j];
            }

            gcnt[gen]++;
        }

        for (int i = z - 1; i >= 0; i--) {
            int[] f = new int[N];
            int tmp3 = z;
            for (int j = 0; j < N; j++) {
                if (j == N - 1) tmp3 /= list.get(i).y;
                f[i] = j / tmp3;
            }
            for (int j = 0; j < N; j++) {
                
            }
        }
    }

    public class Pair {
        int x, y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }

    int ni() throws IOException {
        return Integer.parseInt(ns());
    }

    long nl() throws IOException {
        return Long.parseLong(ns());
    }

    double nd() throws IOException {
        return Double.parseDouble(ns());
    }

    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }

    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }

    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }

    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}

Submission Info

Submission Time
Task C - ロト2
User CrazyBBB
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 3446 Byte
Status RE
Exec Time 269 ms
Memory 41724 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
RE × 3
RE × 25
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_random_01.txt, 10_random_02.txt, 10_random_03.txt, 10_random_04.txt, 10_random_05.txt, 20_max_01.txt, 20_max_02.txt, 20_max_03.txt, 20_max_04.txt, 20_max_05.txt, 30_overflow_01.txt, 30_overflow_02.txt, 40_dmax_01.txt, 40_dmax_02.txt, 40_dmax_03.txt, 50_prime_01.txt, 50_prime_02.txt, 50_prime_03.txt, 60_prime_pow_01.txt, 60_prime_pow_02.txt, 60_prime_pow_03.txt, 70_one_01.txt
Case Name Status Exec Time Memory
00_example_01.txt RE 97 ms 8144 KB
00_example_02.txt RE 96 ms 8144 KB
00_example_03.txt RE 97 ms 8276 KB
10_random_01.txt RE 101 ms 8660 KB
10_random_02.txt RE 112 ms 8660 KB
10_random_03.txt RE 101 ms 8396 KB
10_random_04.txt RE 99 ms 8400 KB
10_random_05.txt RE 102 ms 8524 KB
20_max_01.txt RE 234 ms 32120 KB
20_max_02.txt RE 235 ms 31800 KB
20_max_03.txt RE 264 ms 41720 KB
20_max_04.txt RE 247 ms 33148 KB
20_max_05.txt RE 269 ms 41412 KB
30_overflow_01.txt RE 237 ms 31216 KB
30_overflow_02.txt RE 234 ms 31296 KB
40_dmax_01.txt RE 258 ms 40904 KB
40_dmax_02.txt RE 263 ms 41256 KB
40_dmax_03.txt RE 261 ms 40808 KB
50_prime_01.txt RE 233 ms 33164 KB
50_prime_02.txt RE 249 ms 33372 KB
50_prime_03.txt RE 264 ms 41724 KB
60_prime_pow_01.txt RE 253 ms 34184 KB
60_prime_pow_02.txt RE 242 ms 33108 KB
60_prime_pow_03.txt RE 242 ms 33008 KB
70_one_01.txt RE 242 ms 32092 KB