PAT乙题1013. 数素数 (20)

2018/01/25 PAT 共 789 字,约 3 分钟
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<map>
#include<string>
#include<fstream>
#include<vector>
#include<stack>
#include<functional>
using namespace std;
bool isprime(int d) {
	for (int i = 2; i*i <= d; i++) {
		if (d%i == 0) {
			return false;
		}
	}
	return true;
}
int main() {
#ifdef LOCAL
	freopen("d:\\datain.txt", "r", stdin);
	//freopen("d:\\dataout.txt", "w", stdout);
#endif LOCAL
	int n, m;
	cin >> m >> n;
	int j = 0;
	for (int i = 2;; i++) {
		if (isprime(i)) {
			j++;
			//cout << "j" << j;
			if (j >= n) {
				cout << i;
				break;
			}
			if (j >= m) {
				//cout << "j:" << j;
				cout << i ;
				if (j>m&&(j-m+1)%10==0) {
					cout << endl;
				}
				else {
					cout << " ";
				}
			}
		}
	}
	return 0;
}

Search

    Table of Contents