Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- int reduce(long ar[], int n);
- int main()
- {
- long tab[] = {5, 3, 5, 6, 8, 2, 1, 3, 2, 8, 6, 1, 7};
- int size = reduce(tab, 13);
- std::cout << "size: " << size << std::endl;
- std::cout << "tab: ";
- std::for_each(tab, tab+size, [](const int& i){std::cout << i << " ";});
- return 0;
- }
- int reduce(long ar[], int n)
- {
- std::sort(ar, ar+n);
- int size{};
- long* end = std::unique(ar, ar+n);
- for (long* it = ar; it != end; ++it)
- {
- ++size;
- }
- return size;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement