Cod sursa(job #1250235)
Utilizator | Data | 27 octombrie 2014 22:08:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int k=0;
long int N,i,j;
bool v[2000000];
f>>N;
for(i=2;i<=N;i++)
v[i]=1;
for(i=2;i*i<=N;i++)
if(v[i])
for(j=2;j*i<=N;j++)
v[j*i]=0;
for(i=2;i<=N;i++)
if(v[i])
k++;
g<<k;
f.close();
g.close();
return 0;
}