Cod sursa(job #1152976)
Utilizator | Data | 25 martie 2014 10:03:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define maxn 2000004
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int prim[maxn],n,nrp;
int main()
{
f>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++){
if(prim[i]==1 ){
nrp++;
for(int j=i;j<=n;j+=i)
prim[j]=0;
}
}
g<<nrp;
return 0;
}