Cod sursa(job #2257668)
Utilizator | Data | 10 octombrie 2018 12:20:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int v[30001],pas,i,nr,k,n;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=1;i<=n;i++)
v[i]=i;
k=n;
while(k!=0)
{
pas++;
k=k/2;
}
fout<<pas<<"\n";
fin.close();
fout.close();
return 0;
}