Advertisement
Farjana_akter

Untitled

Jan 3rd, 2020
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.61 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5.  
  6. int main()
  7. {
  8. 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;
  9. while(cin>>n && n)
  10. {
  11. if(line++)
  12. cout<<endl;
  13. flag=0,flag1=0,flag2=0,j=0,flag3=0;
  14. for(a=0;a<=9;a++)
  15. {
  16. for(b=0;b<=9;b++)
  17. {
  18. if(b==a)
  19. continue;
  20. else
  21. {
  22. for(c=0;c<=9;c++)
  23. {
  24. if(c==a || c==b)
  25. continue;
  26. else
  27. {
  28. for(d=0;d<=9;d++)
  29. {
  30. if(d==a|| d==b || d==c)
  31. continue;
  32. else
  33. {
  34. for(e=0;e<=9;e++)
  35. {
  36. if(e==a||e==b|| e==c||e==d)
  37. continue;
  38. else
  39. {
  40. arr[1]=a;
  41. arr[2]=b;
  42. arr[3]=c;
  43. arr[4]=d;
  44. arr[5]=e;
  45. fghij=a*10000+b*1000+c*100+d*10+e;
  46. abcde=n*fghij;
  47. if(abcde<100000)
  48. {
  49. x=abcde;
  50. flag=0,j=1;
  51. memset(brr,0,sizeof(brr));
  52. while(x)
  53. {
  54. y=x%10;
  55. brr[j++]=y;
  56. x/=10;
  57. }
  58. for(i=5;i>=1;i--)
  59. {
  60. for(k=1;k<=5;k++)
  61. {
  62. if(brr[i]==arr[k])
  63. {
  64. flag=1;
  65. break;
  66. }
  67. }
  68. }
  69. /* for(i=1;i<=5;i++)
  70. cout<<brr[i]<<" ";
  71. cout<<endl;
  72. */// cout<<"suru"<<endl;
  73. flag2=0;
  74. for(i=1;i<=5;i++)
  75. {
  76. for(k=i+1;k<=5;k++)
  77. {
  78. if(brr[i]==brr[k])
  79. {
  80. flag2=1;
  81. break;
  82. }
  83. }
  84. }
  85. // cout<<flag<<" "<<flag2<<endl;
  86. if(flag==0 && flag2==0)
  87. {
  88. cout<<brr[5]<<brr[4]<<brr[3]<<brr[2]<<brr[1]<<" / "<<arr[1]<<arr[2]<<arr[3]<<arr[4]<<arr[5]<<" = "<<n<<endl;
  89. flag1=1;
  90. }
  91. }
  92. }
  93. }
  94. }
  95. }
  96. }
  97. }
  98. }
  99. }
  100. }
  101. if(flag1==0)
  102. cout<<"There are no solutions for "<<n<<"."<<endl;
  103. }
  104. return 0;
  105. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement