結果

問題 No.843 Triple Primes
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-06-28 21:42:48
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,436 bytes
コンパイル時間 2,438 ms
コンパイル使用メモリ 81,684 KB
実行使用メモリ 58,916 KB
最終ジャッジ日時 2023-09-14 21:46:27
合計ジャッジ時間 12,773 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
50,976 KB
testcase_01 AC 308 ms
58,400 KB
testcase_02 AC 82 ms
52,460 KB
testcase_03 AC 82 ms
52,480 KB
testcase_04 AC 83 ms
52,456 KB
testcase_05 AC 82 ms
52,376 KB
testcase_06 AC 83 ms
52,428 KB
testcase_07 AC 260 ms
58,592 KB
testcase_08 AC 275 ms
58,604 KB
testcase_09 AC 305 ms
58,156 KB
testcase_10 AC 268 ms
58,916 KB
testcase_11 AC 283 ms
58,472 KB
testcase_12 AC 309 ms
58,344 KB
testcase_13 AC 294 ms
58,492 KB
testcase_14 AC 290 ms
58,492 KB
testcase_15 AC 259 ms
58,524 KB
testcase_16 AC 268 ms
56,700 KB
testcase_17 AC 70 ms
50,716 KB
testcase_18 WA -
testcase_19 AC 69 ms
50,688 KB
testcase_20 AC 148 ms
55,940 KB
testcase_21 AC 129 ms
55,760 KB
testcase_22 AC 214 ms
56,180 KB
testcase_23 AC 209 ms
56,420 KB
testcase_24 AC 153 ms
56,136 KB
testcase_25 AC 146 ms
55,676 KB
testcase_26 AC 312 ms
58,292 KB
testcase_27 AC 101 ms
55,340 KB
testcase_28 AC 297 ms
58,592 KB
testcase_29 AC 154 ms
55,868 KB
testcase_30 AC 299 ms
58,568 KB
testcase_31 AC 108 ms
55,612 KB
testcase_32 AC 100 ms
55,352 KB
testcase_33 AC 157 ms
56,156 KB
testcase_34 AC 196 ms
56,020 KB
testcase_35 AC 318 ms
58,368 KB
testcase_36 AC 141 ms
56,252 KB
testcase_37 AC 255 ms
58,568 KB
testcase_38 AC 225 ms
58,576 KB
testcase_39 AC 296 ms
58,580 KB
testcase_40 WA -
testcase_41 AC 70 ms
50,792 KB
testcase_42 AC 271 ms
58,436 KB
testcase_43 AC 281 ms
58,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class Main {


  private static void solve() {
    int n = ni();

    int[] primes = sieveEratosthenes(n);
    Set<Integer> sq = new HashSet<>();
    for (int p : primes) {
      sq.add(p);
    }

    int m = primes.length;
    int ret = 0;
    for (int i = 0; i < m; i ++) {
      for (int j = 0; primes[j] * primes[j] <= n * 2; j ++) {
        if (sq.contains(primes[j] * primes[j] - primes[i])) {
          ret ++;
        }
      }
    }
    System.out.println(ret);
  }

  public static int[] sieveEratosthenes(int n) {
    if (n <= 32) {
      int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
      for (int i = 0; i < primes.length; i++) {
        if (n < primes[i]) {
          return Arrays.copyOf(primes, i);
        }
      }
      return primes;
    }

    int u = n + 32;
    double lu = Math.log(u);
    int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
    ret[0] = 2;
    int pos = 1;

    int[] isnp = new int[(n + 1) / 32 / 2 + 1];
    int sup = (n + 1) / 32 / 2 + 1;

    int[] tprimes = {3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
    for (int tp : tprimes) {
      ret[pos++] = tp;
      int[] ptn = new int[tp];
      for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
        ptn[i >> 5] |= 1 << (i & 31);
      for (int j = 0; j < sup; j += tp) {
        for (int i = 0; i < tp && i + j < sup; i++) {
          isnp[j + i] |= ptn[i];
        }
      }
    }

    // 3,5,7
    // 2x+3=n
    int[] magic = {0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10,
        7, 12, 21, 17, 9, 6, 16, 5, 15, 14};
    int h = n / 2;
    for (int i = 0; i < sup; i++) {
      for (int j = ~isnp[i]; j != 0; j &= j - 1) {
        int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
        int p = 2 * pp + 3;
        if (p > n)
          break;
        ret[pos++] = p;
        if ((long) p * p > n)
          continue;
        for (int q = (p * p - 3) / 2; q <= h; q += p)
          isnp[q >> 5] |= 1 << q;
      }
    }

    return Arrays.copyOf(ret, pos);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0