Cod sursa(job #2207672)
Utilizator | Data | 26 mai 2018 12:38:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
bool v[2000005];
int n, af=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
int p=2;
for(int i=2; i<=n; i++)
{
if(!v[i])
{af++; for(int j=i+i; j<=n; j=j+i) v[j]=true;}
}
g<<af;
return 0;
}