Cod sursa(job #1999600)
Utilizator | Data | 11 iulie 2017 16:59:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000005];
int main()
{
int n,i,d,cnt=0;
f>>n;
i=2;
while(i<n)
{
i+=2;
v[i]=1;
}
for(d=3;d<=n;d+=2)
{
i=d;
while(i<n)
{
i+=d;
v[i]=1;
}
}
for(i=2;i<=n;++i)
if(v[i]==0)
cnt++;
g<<cnt;
return 0;
}