Cod sursa(job #307435)
Utilizator | Data | 24 aprilie 2009 10:15:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
char a[2000001]={0};
int main()
{
int i,j,y=0,n;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
a[1]=1;
for(i=2;i*i<=n;i++)
if(a[i]==0)
for(j=i*i;j<=n;j+=i)
a[j]=1;
for(i=2;i<=n;i++)
if(a[i]==0)
y++;
out<<y;
return 0;
}