Submission

Score: 100

User: cherries

Problemset: จำนวนเฉพาะ (2560)

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-01 22:26:06

#include <iostream>
#include <vector>

class Solution {
public:
    std::vector<int> listPrime(int n) {
        std::vector<bool> flags(n + 1, true);
        flags[0] = flags[1] = false;

        for (int p = 2; p * p <= n; p++) {
            if (flags[p]) {
                for (int i = p * p; i <= n; i += p) flags[i] = false;
            };
        };

        std::vector<int> result;
        for (int i = 2; i < n; i++) {
            if (flags[i]) result.push_back(i);
        };

        return result;
    };
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);

    Solution solve;

    int n;
    std::cin >> n;

    std::vector<int> result = solve.listPrime(n);
    for (int i = 0; i < result.size(); i++) std::cout << result[i] << std::endl;

    return 0;
};