Cod sursa(job #1863948)
Utilizator | Data | 31 ianuarie 2017 12:53:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000002];
int main()
{
int n,i,j,cont=0;
in>>n;
for(i=2;i<=n;++i)
if(v[i]==0)
{
cont++;
for (j=i;j<=n;j=j+i)
v[j]=1;
}
out<<cont;
return 0;
}