Project Euler：Problem 43 Sub-string divisibility

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.

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

unsigned long long res = 0;
int prime[7] = { 2, 3, 5, 7, 11, 13, 17 };

bool divis(string s)
{
	for (int i = 1; i <= 7; i++)
	{
		int d = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
		if (d%prime[i - 1] != 0)
			return false;
	}
	return true;
}
 
void perm(int list[], int n, int k)
{
	int temp1, temp2;
	if (n == 1)
	{		
		if (list[k] != 0)
		{
			string s = "";
			unsigned long long sum = 0;
			for (int i = 1; i <= k; i++)
			{
				char a = list[i] + '0';
				s = s + a;
				sum = sum * 10 + list[i];
			}
			if (divis(s))
				res += sum;
		}
	}
	else
	for (int i = 1; i <= n; i++)
	{
		temp1 = list[i];
		list[i] = list[n];
		list[n] = temp1;

		perm(list, n - 1, k);

		temp2 = list[i];
		list[i] = list[n];
		list[n] = temp2;
	}
}

int main()
{
	int list[11];
	for (int i = 1; i <= 10; i++)
		list[i] = i-1;
	perm(list, 10, 10);

	cout << res << endl;
	system("pause");

	return 0;
}