Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n,i,j,k,abcde,arr[10],fghij,x,y,z,line=0,a,flag3=0,b,c,d,e,flag=0,flag1=0,brr[10],flag2=0;
- while(cin>>n && n)
- {
- if(line++)
- cout<<endl;
- flag=0,flag1=0,flag2=0,j=0,flag3=0;
- for(a=0;a<=9;a++)
- {
- for(b=0;b<=9;b++)
- {
- if(b==a)
- continue;
- else
- {
- for(c=0;c<=9;c++)
- {
- if(c==a || c==b)
- continue;
- else
- {
- for(d=0;d<=9;d++)
- {
- if(d==a|| d==b || d==c)
- continue;
- else
- {
- for(e=0;e<=9;e++)
- {
- if(e==a||e==b|| e==c||e==d)
- continue;
- else
- {
- arr[1]=a;
- arr[2]=b;
- arr[3]=c;
- arr[4]=d;
- arr[5]=e;
- fghij=a*10000+b*1000+c*100+d*10+e;
- abcde=n*fghij;
- if(abcde<100000)
- {
- x=abcde;
- flag=0,j=1;
- memset(brr,0,sizeof(brr));
- while(x)
- {
- y=x%10;
- brr[j++]=y;
- x/=10;
- }
- for(i=5;i>=1;i--)
- {
- for(k=1;k<=5;k++)
- {
- if(brr[i]==arr[k])
- {
- flag=1;
- break;
- }
- }
- }
- /* for(i=1;i<=5;i++)
- cout<<brr[i]<<" ";
- cout<<endl;
- */// cout<<"suru"<<endl;
- flag2=0;
- for(i=1;i<=5;i++)
- {
- for(k=i+1;k<=5;k++)
- {
- if(brr[i]==brr[k])
- {
- flag2=1;
- break;
- }
- }
- }
- // cout<<flag<<" "<<flag2<<endl;
- if(flag==0 && flag2==0)
- {
- cout<<brr[5]<<brr[4]<<brr[3]<<brr[2]<<brr[1]<<" / "<<arr[1]<<arr[2]<<arr[3]<<arr[4]<<arr[5]<<" = "<<n<<endl;
- flag1=1;
- }
- }
- }
- }
- }
- }
- }
- }
- }
- }
- }
- if(flag1==0)
- cout<<"There are no solutions for "<<n<<"."<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement