1.A prime-checking function
BeginnerWrite bool is_prime(int n) and use it to print every prime number from 1 to 30 on one line.
Show hint
Numbers below 2 are not prime. Otherwise, try divisors d while d * d <= n.
Show solution
#include <iostream>
bool is_prime(int n) {
if (n < 2) return false;
for (int d = 2; d * d <= n; ++d) {
if (n % d == 0) return false;
}
return true;
}
int main() {
for (int i = 1; i <= 30; ++i) {
if (is_prime(i)) std::cout << i << ' ';
}
std::cout << '\n';
}2 3 5 7 11 13 17 19 23 29