Cod sursa(job #1268593)
Utilizator | Data | 21 noiembrie 2014 08:19:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 2000000
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[MAX],n;
void ciur()
{
a[1]=1;
for(int i=2;i<=n;i++)
for(int j=i*i;j<=n;j+=i)
a[j]=1;
}
int main()
{
fin>>n;
int k=0;
ciur();
for(int i=1;i<=n;i++)
if(a[i]==0)
k++;
fout<<k;
return 0;
}