Cod sursa(job #1927061)
Utilizator | Data | 14 martie 2017 21:45:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,n,v[200001],nr;
int main()
{
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
for(j=i*2;j<=n;j=j+i)
v[j]=1;
for(i=2;i<=n;i++)
if(v[i]==0) nr++;
g<<nr;
return 0;
}