This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_primes
#include "../../template/template.hpp"
#include "../../math/number-theory/enumerate-primes.hpp"
int main() {
int N, A, B;
cin >> N >> A >> B;
auto d = enumerate_primes(N);
vector< int > ans;
for(int i = B; i < d.size(); i += A) {
ans.emplace_back(d[i]);
}
cout << d.size() << " " << ans.size() << "\n";
cout << ans << "\n";
}
#line 1 "test/verify/yosupo-enumerate-primes.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_primes
#line 1 "template/template.hpp"
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
for(int i = 0; i < (int) v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
for(T &in : v) is >> in;
return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/yosupo-enumerate-primes.test.cpp"
#line 1 "math/number-theory/prime-table.hpp"
/**
* @brief Prime Table(素数テーブル)
*
*/
vector< bool > prime_table(int n) {
vector< bool > prime(n + 1, true);
if(n >= 0) prime[0] = false;
if(n >= 1) prime[1] = false;
for(int i = 2; i * i <= n; i++) {
if(!prime[i]) continue;
for(int j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
#line 2 "math/number-theory/enumerate-primes.hpp"
vector< int > enumerate_primes(int n) {
if(n <= 1) return {};
auto d = prime_table(n);
vector< int > primes;
primes.reserve(count(begin(d), end(d), true));
for(int i = 0; i < d.size(); i++) {
if(d[i]) primes.push_back(i);
}
return primes;
}
#line 6 "test/verify/yosupo-enumerate-primes.test.cpp"
int main() {
int N, A, B;
cin >> N >> A >> B;
auto d = enumerate_primes(N);
vector< int > ans;
for(int i = B; i < d.size(); i += A) {
ans.emplace_back(d[i]);
}
cout << d.size() << " " << ans.size() << "\n";
cout << ans << "\n";
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 1_00 | AC | 6 ms | 4 MB |
g++ | 2_00 | AC | 6 ms | 4 MB |
g++ | 499477801_00 | AC | 3778 ms | 167 MB |
g++ | 499999993_00 | AC | 3805 ms | 167 MB |
g++ | example_00 | AC | 7 ms | 4 MB |
g++ | max_00 | AC | 3849 ms | 167 MB |
g++ | max_01 | AC | 3903 ms | 167 MB |
g++ | ten_00 | AC | 673 ms | 38 MB |
g++ | ten_01 | AC | 111 ms | 14 MB |
g++ | ten_02 | AC | 17 ms | 4 MB |
clang++ | 1_00 | AC | 6 ms | 4 MB |
clang++ | 2_00 | AC | 6 ms | 4 MB |
clang++ | 499477801_00 | AC | 3391 ms | 167 MB |
clang++ | 499999993_00 | AC | 3376 ms | 167 MB |
clang++ | example_00 | AC | 7 ms | 4 MB |
clang++ | max_00 | AC | 3407 ms | 167 MB |
clang++ | max_01 | AC | 3435 ms | 167 MB |
clang++ | ten_00 | AC | 590 ms | 38 MB |
clang++ | ten_01 | AC | 103 ms | 13 MB |
clang++ | ten_02 | AC | 17 ms | 4 MB |