Project Euler：Problem 35 Circular primes

The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.

There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.

How many circular primes are there below one million?

#include <iostream>
#include <vector>
using namespace std;

bool isPrime[1000010];

bool ok(int n)
{
	if (!isPrime[n])
		return false;
	int tmp[6] = { 0 };
	int count = 0;
	while (n)
	{
		tmp[count++] = n % 10;
		n /= 10;
	}
	reverse(tmp, tmp + count);
	for (int i = 0; i < count; i++)
	{
		int num = 0;
		int k = 0;
		for (int j = i; k < count; j = (j + 1) % count, k++)
			num = num * 10 + tmp[j];
		if (!isPrime[num])
			return false;
	}
	return true;

}

int main()
{
	memset(isPrime, true, sizeof(isPrime));
	for (int i = 2; i <= 1010; i++)
	{
		if (isPrime[i])
		{
			for (int j = 2; j*i < 1000010; j++)
			{
				isPrime[i*j] = false;
			}
		}
	}
	int ans = 0;
	for (int i = 2; i <= 1000000; i++)
	{
		//cout << i << " " << isPrime[i] << endl;
		if (ok(i))
			ans++;
	}
	cout << ans << endl;
	system("pause");
	return 0;
}