p-7-2求解素数个数问题

非递归（效率牛逼）链接
递归（效率一般）链接

#include <bits/stdc++.h>
using namespace std;

bool g1(int x) {
	for(int i = 2; i <= sqrt(x); i++)
		if(x % i == 0)
			return false;
	return true;

}

int f1(int m) {
	int count = 0;
	for(int i = 1; i <= m; i++){
		if(i == 1)
			continue;
		if(g1(i)) 
			count++;
	}
		
	return count;
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int m;
	cin >> m;
	cout << f1(m);

	return 0;
}