Cod sursa(job #1330736)
Utilizator | Data | 30 ianuarie 2015 22:04:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
#define nmax 2000010
int n,rez;
bool v[nmax];
int main()
{
int i,j;
cin>>n;
for (i=2;i<=n;i+=2)
v[i]=1;
for (i=3;i<=n;i+=2)
if (!v[i])
{
rez++;
for (j=i*i;j<=n;j+=2*i)
v[j]=1;
}
cout<<rez+1;
}