Cod sursa(job #1365458)
Utilizator | Data | 28 februarie 2015 12:03:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#define N 2000001
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool ciur[N];
int n,i,j,cnt=0;
cin>>n;
for(i=1;i<=n;i++)
ciur[i]=true;
for(i=2;i<=n;i++)
if(ciur[i]==true)
{cnt++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
cout<<cnt;}
return 0;
}