python/TangDou/LianXiTi50/2.cpp

#include<bits/stdc++.h>

using namespace std;

//<2F>ж<EFBFBD><D0B6>Dz<EFBFBD><C7B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 
bool isPrime(int n) {
    if (n < 2)return false;
    for (int i = 2; i <= n / i; i++)
        if (n % i == 0) return false;
    return true;
}


int main() {
    for (int i = 100; i <= 200; i++)
        if (isPrime(i)) cout << i << " ";
    cout << endl;
    return 0;
}