Cod sursa(job #1047501)
Utilizator | Data | 4 decembrie 2013 16:48:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,c,j;
f>>n;
bool v[2000001];
for(i=1;i<=n;i++)
v[i]=0;
for(i=2;i<=n;i++)
if((v[i]==0))
{ c++;
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
g<<c;
f.close();
g.close();
}