c++ 100-200 之间的全部素数

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main() {
	int m, k, i, n = 0;
	bool prime;                  //定义布尔变量prime
	for (m = 101; m <= 200; m = m + 2) {
		prime = true;
		k = int(sqrt(m));            //m的整数部分
		for (i = 2; i <= k; i++)
			if (m % i == 0)               //m被2~sqrt(m)除
					{
				prime = false;
				break;
			}
		if (prime) {
			cout << setw(5) << m;
			n = n + 1;
		}
		if (n % 10 == 0)            //输出10个数后换行
			cout << endl;
	}
	cout << endl;
	return 0;
}