Submission #5916852
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
#define CINT(...) \
int __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, VL, greater<ll>> PQG;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18 + 1;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};
ll N;
bool is_prime[(ll)1e6];
bool is_prime_small[(ll)1e6];
VL seg_sieve(ll a, ll b) {
VL res;
for(ll i = 2; i * i < b; i++) is_prime_small[i] = true;
REP(i, b - a) is_prime[i] = true;
for(ll i = 2; i * i < b; i++) {
if(is_prime_small[i]) {
for(ll j = 2 * i; j * j < b; j += i) is_prime_small[j] = false;
for(ll j = max(2LL, (a + i - 1) / i) * i; j < b; j += i)
is_prime[j - a] = false;
}
}
REP(i, b - a) if(is_prime[i]) res.emplace_back(i + a);
return res;
}
signed main() {
cin >> N;
VL ans = seg_sieve(2, 55556);
REP(i, N) { cout << ans[i + (N % 2)] << " "; }
cout << "\n";
}
Submission Info
Submission Time |
|
Task |
D - Five, Five Everywhere |
User |
arktan763 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3142 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
384 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
in01.txt, in02.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name |
Status |
Exec Time |
Memory |
in01.txt |
WA |
1 ms |
384 KB |
in02.txt |
WA |
1 ms |
384 KB |
sample_01.txt |
AC |
1 ms |
384 KB |
sample_02.txt |
AC |
1 ms |
384 KB |
sample_03.txt |
WA |
1 ms |
384 KB |