Cod sursa(job #1011747)
| Utilizator | Data | 17 octombrie 2013 12:30:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include<cmath>
#include<vector>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{ int n,i,j,k,l,s=0;
in>>n;
bool ciur[2000002];
ciur[0]=ciur[1]=false;
for(i=2; i<=n; i++)
ciur[i]=true;
for(i=2; i<=n;i++)
{
if(ciur[i]==true)
for(j=i*2;j<=n; j=j+i)
ciur[j]=false;
}
for(l=2; l<=n; l++ )
if(ciur[l]==true) {s=s+1;}
out<<s;
out<<endl;
return 0;
}
