PKUOJ 区间内的真素数

http://bailian.openjudge.cn/tm2018/A/

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
#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <sstream>
using namespace std;
 
bool isPrime(int n)
{
    for (int i = 2; i <=sqrt(n); i++)
    {
        if (n%i == 0)
        {
            return false;
        }
    }
    return true;
}
 
 
int Reverse(int n)
{
    std::string temp;
    std::stringstream ss;
    ss << n;
    ss >> temp;
    reverse(temp.begin(), temp.end());
    int t = atoi(temp.c_str());
    return t;
}
 
int main()
{
    int M, N;
    cin >> M >> N;
    std::string c;
    for (int i = M; i <= N; i++)
    {
        if (isPrime(i) && isPrime(Reverse(i)))
        {
            stringstream ss;
            string temp;
            ss << i;
            ss >> temp;
            c=c+temp+",";
        }
    }
    if (c.size()<1)
    {
        std::cout << "No";
    }
    else
    {
        for (int i = 0; i < c.size()-1;i++)
        {
            std::cout << c[i];
        }
    }
    //system("pause");
    return 0;
}

  

posted @   唐淼  阅读(357)  评论(0编辑  收藏  举报
努力加载评论中...
点击右上角即可分享
微信分享提示