725 - Division STLpair

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=666

#include<bits/stdc++.h>
using namespace std;
const int maxn=10010;
vector<pair<int,int> > g[maxn];

int main(){
	int a[10]={0,1,2,3,4,5,6,7,8,9};
		do{
			int d2=a[0]*10000+a[1]*1000+a[2]*100+a[3]*10+a[4];
			int d1=a[5]*10000+a[6]*1000+a[7]*100+a[8]*10+a[9];
			if((d1%d2)==0){
				g[d1/d2].push_back(make_pair(d1,d2));
				
			}
			
		}while(next_permutation(a,a+10));
	int n;
	cin>>n;
	int f=1;
	while(n!=0){
		if(!g[n].size()){
			f=0;
			cout<<"There are no solutions for "<<n<<"."<<endl;
			//cout<<endl;
		}
		else
		{
			for(int i=0;i<g[n].size();i++)
			{
				f=0;
				printf("%05d / %05d = %d\n",g[n][i].first,g[n][i].second,n);
			}
			
		}
		cin>>n;
		if(n)
		cout<<endl;
	}
	return 0;
}