Cod sursa(job #2329477)
Utilizator | Data | 26 ianuarie 2019 20:06:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ap[20001];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n ;
fin>>n;
int con=0;
for(int i=2;i<=n;i++)
{
if(ap[i]!=1)
{
con++;
for(int j=2;j*i<=n;j++)
{
ap[j*i]=1;
}
}
}
fout<<con;
fin.close();
fout.close();
return 0;
}