Cod sursa(job #1181388)
Utilizator | Data | 2 mai 2014 16:52:56 | |
---|---|---|---|
Problema | Ridicare la putere in timp logaritmic | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
/*
Keep It Simple!
*/
#include<fstream>
using namespace std;
int N;
bool prim[2000005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> N;
int cnt = 1;
for(int i=3;i<=N;i+=2)
{
if(!prim[i])
{
cnt++;
for(int j=i;j<=N;j+=i)
prim[j] = 1;
}
}
g << cnt;
}