Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int BubleSort(int[], int);
- int main()
- {
- int n;
- cout << "n="; cin >> n;
- int v[20];
- int k = 0;
- for (int i = n; i; i /= 10)
- {
- v[k] = i % 10;
- k++;
- }
- int ok;
- int i = 0;
- do
- {
- ok = 0;
- for (int j =0; j<k-i-1; j++)
- {
- if (v[j] > v[j + 1])
- {
- swap(v[j], v[j + 1]);
- ok = 1;
- }
- }
- i++;
- } while (ok);
- int nr_max = 0;
- for (int i = k-1; i >= 0; i--)
- {
- if (v[i]!=v[i+1])
- nr_max = nr_max * 10 + v[i];
- }
- int nr_min = 0;
- for (int i = 0; i < k - 1; i++)
- nr_min = nr_min * 10 + v[i];
- cout << "Nr max este:" << nr_max << endl;
- cout << "Nr min este:" << nr_min << endl;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement