Problem 32 Pandigital products （暴力+set）

Pandigital products

Problem 32

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, the 5-digit number, 15234, is 1 through 5 pandigital.

The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.

HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.

Answer: 45228 Completed on Sat, 29 Oct 2016, 04:41

题解：暴力+set...

代码：

#include<bits/stdc++.h>
using namespace std;


int main()
{
	int ans=0;
	int sum=0;
	set<int> s;
	int a[9]={1,2,3,4,5,6,7,8,9};
	do
	{
		if( a[0]* (a[1]*1000+a[2]*100+a[3]*10+a[4]) == a[5]*1000+a[6]*100+a[7]*10+a[8] ){
			ans++;
			//sum+=a[5]*1000+a[6]*100+a[7]*10+a[8];
			s.insert(a[5]*1000+a[6]*100+a[7]*10+a[8]);
		}
		else if((a[0]*10+a[1]) * (a[2]*100+a[3]*10+a[4]) == a[5]*1000+a[6]*100+a[7]*10+a[8] ){
			ans++;
			//sum+=a[5]*1000+a[6]*100+a[7]*10+a[8];
			s.insert(a[5]*1000+a[6]*100+a[7]*10+a[8]);
		}
		
	}while(next_permutation(a,a+9));
	//cout<<ans<<endl;
	for(set<int>::iterator it=s.begin();it!=s.end();it++) sum+=*it;
	cout<<sum<<endl;
	return 0;
}