/*先求出所有素数,放在num[78498]里。再逐个判断num数组的每个数是不是圆周数
其中,圆周数的判断用到了queue数据结构,实现一个循环队列*/
#include <iostream>
#include <Windows.h>
#include <math.h>
#include <queue>
using namespace std;
int primes(int n)
{
int ok = 1;
if (n == 2)return ok;
for (int i = 2; i <= sqrt(n); ++i)
{
if (n%i == 0)
{
ok = 0;
break;
}
}
return ok;
}
int Circular_primes(int n)
{
int digit = 0;
int t = n;
int ok = 1;
queue<int> d;
int num[7] = { 0 };
while (t > 0)
{
d.push(t % 10);
t /= 10;
digit++;
}
if (digit == 1)return 1;
int x = d.size();
for (int i = 0; i < digit; ++i)
{
for (int j = 0; j < x; ++j)
{
num[i] += d.front()*pow(10,j);
d.push(d.front());
d.pop();
}
d.push(d.front());
d.pop();
}
for (int i = 0; i < digit; ++i)
{
if (!primes(num[i]))
{
ok = 0;
break;
}
}
return ok;
}
int main()
{
DWORD s = GetTickCount();
{
int count = 0;
int num[78498];
int ccount = 0;
for (int i = 2; i <= 1000000; ++i)
{
if (primes(i))
{
num[count] = i;
count++;
}
}
for (int i = 0; i < 78498; ++i)
{
if (Circular_primes(num[i]))
{
cout << num[i] << '\t';
ccount++;
}
}
cout << endl << "count is " << ccount << endl;
}
DWORD e = GetTickCount();
cout << "The running time is " << e - s << " ms" << endl;
system("pause");
}
转载于:https://my.oschina.net/u/3772904/blog/1807172