Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <vector>
- using std::printf;
- using std::scanf;
- using std::vector;
- void Input(int *size) {
- scanf("%d", size);
- }
- void Output(const vector<int> &prime_numbers) {
- for (int i = 0; i < prime_numbers.size(); ++i) {
- printf("%d ", prime_numbers[i]);
- }
- printf("\n");
- }
- void Solve(const int &size, vector<int> *prime_numbers) {
- prime_numbers->push_back(2);
- for (int current_number = 3; current_number < size; current_number += 2) {
- bool is_prime = true;
- for (int i = 0; i < prime_numbers->size(); ++i) {
- if (current_number % prime_numbers->at(i) == 0) {
- is_prime = false;
- break;
- }
- }
- if (is_prime) {
- prime_numbers->push_back(current_number);
- }
- }
- }
- int main() {
- int size;
- Input(&size);
- vector<int> prime_numbers;
- Solve(size, &prime_numbers);
- Output(prime_numbers);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement