Advertisement
SelinD

ex11/151

Jun 4th, 2019
85
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. void maxim(int n,int &maxi,int&k)
  5. {
  6. int poz=0;
  7. maxi=-1;
  8. k=-1;
  9.  
  10. do
  11. {
  12. if(n%10>maxi)
  13. {
  14. maxi=n%10;
  15. k=poz;
  16. }
  17. n=n/10;
  18. poz++;
  19. }
  20. while(n);
  21. }
  22.  
  23. int putere(int n)
  24. {
  25. int p=1;
  26. while(n)
  27. {
  28. p=p*10;
  29. n=n-1;
  30. }
  31. return p;
  32. }
  33.  
  34. int main()
  35. {
  36. int n,i,aux,k,maxi,rez=0,contor=0,ap[10];
  37. cin>>n;
  38. aux=n;
  39. while(aux)
  40. {
  41. ap[aux%10]++;
  42. aux=aux/10;
  43. }
  44. maxim(n,maxi,k);
  45. for(i=0; i<=maxi; i++)
  46. {
  47. while(ap[i])
  48. {
  49. rez=rez+i*putere(contor);
  50. contor++;
  51. ap[i]--;
  52. }
  53. }
  54. cout<<rez<<" ";
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement