Cod sursa(job #2533118)
Utilizator | Data | 28 ianuarie 2020 19:33:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
fstream f("sticle.in");
ofstream g("sticle.out");
int main()
{
int k, q, t, r, p, m;
f >> t;
for (p=1; p<=t; p++)
{
f >> k;
q=1;
r=1;
if (k==1)
g << 0 << endl;
else
while (r<k)
{
r=2*r;
q++;
}
g << q-1 << endl;
}
return 0;
}