欧拉计划Problem 41

We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.

What is the largest n-digit pandigital prime that exists?


#define N 10
int num[N] = {1,2,3,4,5,6,7,8,9};
int max = 0;
int answer = 0;
bool prime(int x)
{
for (int i = 2; i*i <= x; i++)
{
if (x%i == 0)
{
return false;
}
}
return true;
}


void swap(int &x,int &y)
{
int t = x;
x = y;
y = t;
}
void transmit(int num[],int n,int m)
{
if (n == m)
{
int t = num[0];
for (int i = 1; i <= m; i++)
{
t=t*10+num[i];
}
if (prime(t) == true && answer < t)
{
answer = t;
}  
} 
else
{
for (int i = n; i <=m; i++)
{
swap(num[i],num[n]);
transmit(num,n+1,m);
swap(num[i],num[n]);
}
}
}




int main()
{
clock_t ts,te;
ts=clock();
int i;
for (i = 8; i >= 0; i--)
{
transmit(num,0,i);
}
printf("\nanswer %d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}