Cod sursa(job #2084354)
Utilizator | Data | 8 decembrie 2017 23:46:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include<fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[2000000];
int main()
{
int n,i,j,aux,c=0;;
in>>n;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{aux=i;
for(j=i+aux;j<=n;j=j+aux)
{a[j]=1;}}
}
for(i=2;i<=n;i++)
{
if(a[i]==0)
c++;
}
out<<c;
return 0;
}