TP-tut5-zad3

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

bool StepeniDvojke (int n) {
    for (int i=0; i<20; i++) {
            if (pow(2,i)==n) return 1;
    }
    return 0;
}
bool MiniSuma (int a, int b) {
    int suma1=0,suma2=0;
    while (a!=0) {
            suma1+=a%10;
           a/=10;
    }
    while (b!=0) {
            suma2+=b%10;
            b/=10;
    }
    if (suma1<suma2) return true;
    return false;
}
int main () {
 int niz[10]={12,2,6,55,2,9,7,2,14,8};
 cout<<"Najveci element: "<<*(max_element(niz,niz+10))<<endl;

 cout<<"Najmanji element se ponavlja "<<count(niz,niz+10,*(min_element(niz,niz+10)))<<" puta."<<endl;
 cout<<"Brojeva koji su stepeni dvojke ima: "<<count_if(niz,niz+10,StepeniDvojke)<<"."<<endl;
 cout<<"Element sa najmanjom sumom cifara je "<<*(min_element(niz,niz+10,MiniSuma))<<endl;
 return 0;
}