Cod sursa(job #1331291)
Utilizator | Data | 31 ianuarie 2015 15:06:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,contor=0;
in>>n;
char prim[200001];
for(int i=2; i<n; i++)
prim[i]=1;
for(int i=2; i*i<n; i++)
if(prim[i]==1)
for(int j=i*i; j<n; j=j+i)
prim[j]=0;
for(i=0; i<n; i++)
if(prim[i]==1)
contor++;
out<<contor;
}