欧拉计划Problem 43

The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.

Let d₁ be the 1^st digit, d₂ be the 2^nd digit, and so on. In this way, we note the following:

• d₂d₃d₄=406 is divisible by 2
• d₃d₄d₅=063 is divisible by 3
• d₄d₅d₆=635 is divisible by 5
• d₅d₆d₇=357 is divisible by 7
• d₆d₇d₈=572 is divisible by 11
• d₇d₈d₉=728 is divisible by 13
• d₈d₉d₁₀=289 is divisible by 17

Find the sum of all 0 to 9 pandigital numbers with this property.


#define N 10
int divisor[7] = {2,3,5,7,11,13,17};
_int64 answer = 0;


void pand(int n, int m, int num[]);
void newswap(int &x,int &y);
bool check(int num[]);


void pand(int n, int m, int num[])
{
if (n == m)
{
if (check(num) == true)
{
_int64 temp = num[0];
for (int i = 1; i < N; i++)
{
temp = temp*10+num[i];
}
answer+=temp;
}
}
else
{
for (int i = m; i <=n;i++)
{
newswap(num[i],num[m]);
pand(n,m+1,num);
newswap(num[i],num[m]);
}
}
}


bool check(int num[])
{
int i,j;
for (i = 1; i <=7;i++)
{
int t1 = i,t2 = num[i];
for (j = i+1; j < t1+3;j++)
{
t2 = t2*10+num[j];
}
if (t2 % divisor[i-1] != 0)
{
return false;
}
}
return true;
}


void newswap(int &x,int &y)
{
int t = x;
x = y;
y = t;
}
int main()
{
clock_t ts,te;
ts=clock();
int num[N] = {0,1,2,3,4,5,6,7,8,9};
pand(9,0,num);
printf("\nanswer %I64d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}