Cod sursa(job #2489899)
Utilizator | Data | 9 noiembrie 2019 13:00:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,cont
bool v[2000005];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
for(int i=2; i<=n; i++ )
{
if(v[i]==0)
{
cont++;
for(int j=1; j<=n/i; j++)
{
v[i*j]=1;
}
}
}
fout<<cont;
return 0;
}