Advertisement
amermo

TP T-5 Z3 - nedovrsen

Mar 27th, 2015
238
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.24 KB | None | 0 0
  1. #include <iostream>
  2. #include <algorithm>
  3.  
  4. int main()
  5. {
  6.     int niz[5];
  7.     for(auto &x : niz)
  8.         std::cin >> x;
  9.     std::cout << std::endl << "Najveci element u nizu je: " << *std::max_element(niz, niz+5);
  10.     std::cout << std::endl << "Najmanji element se ponavlja : " << std::count(niz, niz+5, *std::min_element(niz, niz+5));
  11.     std::cout << std::endl << "Brojeva koji su stepeni dvojke ima: " << std::count_if(niz, niz+5, [](int x)
  12.     {
  13.         return (x != 0) && ((x & (x-1)) == 0);
  14.     });
  15.     std::cout << std::endl;
  16.     std::cout << "Element sa najmanjom sumom cifara je: " << *std::min_element(niz, niz+5, [](int x, int y) -> bool
  17.     {
  18.         int suma1(0), suma2(0);
  19.         while(x > 0)
  20.         {
  21.             suma1+=x%10;
  22.             x/=10;
  23.         }
  24.         while(y > 0)
  25.         {
  26.             suma2+=y%10;
  27.             y/=10;
  28.         }
  29.         return (suma1 < suma2);
  30.     });
  31.     int niz1[5] {};
  32.     std::copy_if(niz, niz+5, niz1, [](int x) -> bool
  33.     {
  34.         int counter(0), n(x);
  35.         while(n > 0)
  36.         {
  37.             n/=10;
  38.             counter++;
  39.         }
  40.         return (counter == 2);
  41.     });
  42.     std::cout << std::endl;
  43.     for(auto &x : niz1)
  44.         std::cout << x << " ";
  45.     return 0;
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement