-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1013.cpp
65 lines (60 loc) · 1.48 KB
/
1013.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int num)
{
bool ans = true;
if (num <= 1)
ans = false;
else
{
for (int i = 2; i <= sqrt(num); i++)
{
if (num % i == 0)
{
ans = false;
break;
}
}
}
return ans;
}
int main()
{
int sub_prime = 0;
int cnt_prime = 0;
int m, n, sum = 0, num = 2;
cin >> m >> n;
bool print_space = false;
while (sub_prime <= n)
{
if (isPrime(num) == true)
{
sub_prime++;
// if(print_space==true )cout<<" ";
if (sub_prime >= m && sub_prime <= n) //可能需要打印空格
{
cout << num;
print_space = true;
cnt_prime++;
}
if ((cnt_prime % 10 == 0 && cnt_prime != 0) || sub_prime == n)
{
cout << "\n";
print_space = false;
}
if (print_space == true)
{
cout << " ";
print_space = false;
}
// if(sub_prime>=m && sub_prime<n )
// {cout<<num<<" "; cnt_prime++;}
// else if(sub_prime==n || cnt_prime%10==0)
// {cout<<num<<endl; cnt_prime++;}
//问题: cnt_prime==0,0%10==0;
}
num++;
}
return 0;
}//测试点二 格式错误