Cod sursa(job #1621673)
Utilizator | Data | 29 februarie 2016 20:43:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr=1,n,i,j,v[2000002];
int main()
{
f>>n;
if (n<2)
{g<<0;
return 0;}
for (i=3;i<=n;i=i+2)
if (v[i]==0)
{nr++;
for (j=i+i;j<=n;j=j+i)
v[j]=1; }
g<<nr;
return 0;
}