Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- const unsigned int maxIterations = 1000;
- unsigned int number = 1;
- void prime() {
- for (int iteration = 0; iteration < maxIterations; iteration += 1) {
- bool result = false;
- while (!result) {
- number += 1;
- result = true;
- unsigned int sqrt = sqrtf(number);
- for (int i = 2; i <= sqrt; i += 1) {
- if (number % i == 0) {
- result = false;
- }
- }
- }
- std::cout << number << std::endl;
- }
- }
- int main() {
- prime();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
