Cod sursa(job #1365983)
Utilizator | Data | 28 februarie 2015 17:28:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{int n,x=1,i,j;
in>>n;
for(i=3;i<=n;i=i+2)
{
if(v[i]==0) //daca i este nr prim
{
x++;
for(j=i*i;j<=n;j=j+i) //tai multipii
{
v[j]=1;
}
}
}
out<<x;
return 0;
}