Cod sursa(job #2138040)
Utilizator | Data | 21 februarie 2018 11:51:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,q;
bool v[2000001];
int main()
{
for(int i=4;i<=2000000;i=i+2)
{
v[i]=1;
}
for(int i=3;i<=2000000;i=i+2)
{
if(v[i]==0)
{
for(int j=2*i;j<=2000000;j=j+i)
{
v[j]=1;
}
}
}
f>>n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
q++;
}
g<<q;
return 0;
}