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