PAT乙级1003-数素数

令Pi表示第i个素数。现任给两个正整数M <= N <= 10000,请输出PM到PN的所有素数。

 

输入描述:

输入在一行中给出M和N,其间以空格分隔。

 

输出描述:

输出从PM到PN的所有素数,每10个数字占1行,其间以空格分隔,但行末不得有多余空格。

 

输入例子:

5 27

 

输出例子:

11 13 17 19 23 29 31 37 41 43

47 53 59 61 67 71 73 79 83 89

97 101 103


#include<iostream>

#include<stdlib.h>

#include<math.h>

using namespace std;

int main()

{

           int M, N,count=0;

          cout << "请输入两个数字" << endl;

          cin >> M >> N;

           int i = 0;

           for (i = 2; count <= N; i++)

          {

                    int tmp = 0;

                    for (int j = 2; j <=sqrt(i); j++)

                   {

                              if (i%j == 0)

                                      tmp = 1;

                              if (i%j!=0)

                                      count++;

                    for (int j = 2; j <= sqrt(i); j++)

                    if (i % j == 0)

                             ++tmp;

                    if (tmp == 0)

                             ++count;



                              if (tmp ==0 && count >= M&&count <= N)

                                      cout << i << endl;

                   

                   

          }

          

          system( "pause");

           return 0;

}



 

 

 

 

 

 

网上借鉴:

#include<iostream>

#include<cmath>

int main()

{

           using namespace std;

           int m, n, count = 0;

          cin >> m >> n;

           for (int i = 2; count <= n; i++)

          {

                    int temp = 0;

                    for (int j = 2; j <= sqrt(i); j++)

                    if (i % j == 0)

                             ++temp;

                    if (temp == 0)

                             ++count;

                    if (count >= m && count <= n && temp == 0)

                   {

                             cout << i;

                              if ((count - m) % 10 == 9)

                                      cout << endl;

                              else if (count != n)

                                      cout << " ";

                   }

          }

          cout << endl;

           return 0;

}

 

  

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值