Cod sursa(job #2359752)

Utilizator ZeldahUrsu Ianis Vlad Zeldah Data 1 martie 2019 09:20:06
Problema Arbore partial de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.42 kb
#include <fstream>

#define shiftL(x, N) (x<<(N))
#define for_each(x, N) for(auto i=x; i<=N; i++)


int main()
{
    std::fstream fin("sticle.in", std::ios::in), fout("sticle.out", std::ios::out);

    int T;  fin>>T;

    for_each(1, T){

        int p=1, N;  fin>>N;

        if(N==1) {fout<<"0\n"; continue;}

        while(!((shiftL(1, p-1)<N) && N<=shiftL(1, p))) p++;
        fout<<p<<"\n";
    }
}