Cod sursa(job #1331268)
Utilizator | Data | 31 ianuarie 2015 14:54:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,p,cont=0;
in>>n;
bool prim[n+1];
for(p=2;p<=n;p++) prim[p]=1;
for(p=2;p*p<n;p++)
{
if(prim[p])
{
cont++;
for(i=p;i<=n/p;i++) prim[p*i]=0;
}
}
out<<cont;
return 0;
}