Cod sursa(job #1354053)
Utilizator | Data | 21 februarie 2015 16:10:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool c[2000001];
int main()
{
int n,i,j,ok=0;
in>>n;
for(i=1; i<=n; i++)
c[i]=1;
for(i=2; i<=n; i++)
{
if(c[i]==1)
for(j=2; i*j<=n; j++)
c[i*j]=0;
}
for(i=2; i<=n; i++)
if(c[i]==1)
ok++;
out<<ok;
return 0;
}