結果

問題 No.843 Triple Primes
ユーザー amotoma3amotoma3
提出日時 2019-07-06 10:48:37
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,394 bytes
コンパイル時間 2,548 ms
コンパイル使用メモリ 78,416 KB
実行使用メモリ 54,920 KB
最終ジャッジ日時 2024-09-25 01:27:16
合計ジャッジ時間 8,581 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,208 KB
testcase_01 AC 131 ms
54,684 KB
testcase_02 AC 59 ms
50,204 KB
testcase_03 AC 57 ms
50,340 KB
testcase_04 AC 60 ms
50,252 KB
testcase_05 AC 58 ms
50,060 KB
testcase_06 AC 63 ms
50,128 KB
testcase_07 AC 127 ms
54,748 KB
testcase_08 AC 126 ms
54,484 KB
testcase_09 AC 130 ms
54,920 KB
testcase_10 AC 126 ms
54,496 KB
testcase_11 AC 132 ms
54,592 KB
testcase_12 AC 130 ms
54,856 KB
testcase_13 AC 118 ms
54,892 KB
testcase_14 AC 126 ms
54,700 KB
testcase_15 AC 123 ms
54,348 KB
testcase_16 AC 125 ms
54,588 KB
testcase_17 WA -
testcase_18 AC 55 ms
50,452 KB
testcase_19 AC 55 ms
50,140 KB
testcase_20 AC 107 ms
52,788 KB
testcase_21 AC 98 ms
52,408 KB
testcase_22 AC 108 ms
54,848 KB
testcase_23 AC 108 ms
54,660 KB
testcase_24 AC 106 ms
52,556 KB
testcase_25 AC 96 ms
52,044 KB
testcase_26 AC 127 ms
54,212 KB
testcase_27 AC 79 ms
52,052 KB
testcase_28 AC 126 ms
54,736 KB
testcase_29 AC 114 ms
52,784 KB
testcase_30 AC 123 ms
54,848 KB
testcase_31 AC 94 ms
52,044 KB
testcase_32 AC 87 ms
51,784 KB
testcase_33 AC 119 ms
52,636 KB
testcase_34 AC 110 ms
54,100 KB
testcase_35 AC 136 ms
54,760 KB
testcase_36 AC 102 ms
52,380 KB
testcase_37 AC 116 ms
54,604 KB
testcase_38 AC 127 ms
54,776 KB
testcase_39 AC 129 ms
54,228 KB
testcase_40 AC 56 ms
50,732 KB
testcase_41 WA -
testcase_42 AC 130 ms
54,904 KB
testcase_43 AC 133 ms
54,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.util.Set;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.TreeSet;
import java.io.InputStream;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        No843 solver = new No843();
        solver.solve(1, in, out);
        out.close();
    }

    static class No843 {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.readInt();
            Set<Integer> primes = new TreeSet<>(new Prime(n).getPrimes());

            int ans = 0;
            for (int prime : primes) {
                if (prime * prime > n + 2) break;
                if (primes.contains(prime * prime - 2)) ans++;
            }
            out.printLine(2 * ans - 1);
        }

    }

    static class Prime {
        private int n;
        private boolean[] isPrime;
        private ArrayList<Integer> primes;

        public Prime(int n) {
            this.n = n;
            isPrime = new boolean[n + 1];
            primes = new ArrayList<>();
            sieve();
        }

        private void sieve() {
            for (int i = 2; i <= n; i++) {
                if (!isPrime[i]) {
                    primes.add(i);
                    for (long j = (long) i * i; j <= n; j += i) {
                        isPrime[(int) j] = true;
                    }
                }
            }
        }

        public ArrayList<Integer> getPrimes() {
            return primes;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void printLine(int i) {
            writer.println(i);
        }

    }
}
0