Cod sursa(job #677722)
Utilizator | Data | 10 februarie 2012 16:13:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
bool v[2000001]={0};
int main()
{
int n,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i=2;i<=n;++i)
if(!v[i])
for(int j=2*i;j<=n;j+=i)
v[j]=1;
for(int i=2;i<=n;++i)
if(!v[i])
k++;
g<<k;
f.close();
g.close();
return 0;
}