Cod sursa(job #1677260)
Utilizator | Data | 6 aprilie 2016 14:09:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool a[2000001];
int n,i,j,nr;
int main()
{
in>>n;
for(i=2; i<=n; i++)
a[i]=true;
for(i=2; i<=n; i++)
{
if(a[i]==true)
{
for(j=2*i; j<=n; j+=i)
a[j]=false;
}
}
for(i=2; i<=n; i++)
if(a[i]==true) nr++;
out<<nr;
return 0;
}