Cod sursa(job #531218)
Utilizator | Data | 9 februarie 2011 10:56:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,j,p=0;
bool c[2000000];
in>>n;
for(i=2;i*i<n;i++)
if(c[i]==false)
for(j=i*i;j<n;j+=i)
c[j]=true;
for(i=2;i<=n;i++)
if(c[i]==false)
p++;
out<<p;
}