Cod sursa(job #1116744)
Utilizator | Data | 22 februarie 2014 19:38:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#define nx 2000007
using namespace std;
int n,i,j,k;
bool p[nx];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void ciur()
{
for(i=2;i<=n;i++)
if(!p[i])
{
k++;
for(j=i+i;j<=n;j+=i)p[j]=true;
}
}
int main()
{
fin>>n;
ciur();
fout<<k;
return 0;
}