Cod sursa(job #983518)
Utilizator | Data | 12 august 2013 00:42:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
using namespace std;
#include<fstream>
ifstream eu("ciur.in");
ofstream tu("ciur.out");
#define Nmax 2000002
bool prim[Nmax];
int N,K;
void Ciur()
{
for(int i=2;i<=N;i++)
prim[i]=1;
for(int i=2;i<N;i++)
if(prim[i]==1)
{
K++;
for(int j=i+i;j<=N;j=j+i)
prim[j]=0;
}
}
int main()
{
eu>>N;
Ciur();
tu<<K;
return 0;
}