Cod sursa(job #305743)
Utilizator | Dan Florescu danutz_flo | Data | 18 aprilie 2009 14:48:57 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a[1000000]={0},i,j,y=0,n;
ifstream in("ciurn.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i*i<=n;i++)
if(a[i]==0)
for(j=i*i;j<=n;j=j+i)
a[j]=1;
for(i=2;i<=n;i++)
if(a[i]==0)
y++;
out<<y;
return 0;
}