#include<bits/stdc++.h> usingnamespace std; intmain() { int m, n, k = 0, l = 0; cin >> m >> n; for (int i = 2;; i++) { int flag = 0; for (int j = 2; j * j <= i; j++) { if (i % j == 0) { flag = 1; continue; } } if (flag == 0) { k++; if (k >= m && k <= n) { l++; if (l % 10 != 1) cout << " "; cout << i; if (l % 10 == 0) cout << endl; } } if (k == n) break; } return0; }
#include<iostream> #include<vector> usingnamespace std; boolisprime(int a) { for (int i = 2; i * i <= a; i++) if (a % i == 0) returnfalse; returntrue; } intmain() { int M, N, num = 2, cnt = 0; cin >> M >> N; vector<int> v; while (cnt < N) { if (isprime(num)) { cnt++; if (cnt >= M) v.push_back(num); } num++; } cnt = 0; for (int i = 0; i < v.size(); i++) { cnt++; if (cnt % 10 != 1) printf(" "); printf("%d", v[i]); if (cnt % 10 == 0) printf("\n"); } return0; }