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