Cod sursa(job #2029980)
| Utilizator | Data | 30 septembrie 2017 19:11:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool p[2000003];
int main()
{
int n;
f>>n;
p[0]=p[1]=1;
for(int i=2;i<=n/2;i++)
p[2*i]==1;
int nr=1;
for(int i=3;i<=n;i+=2)
if(p[i]==0)
{
nr++;
for(int j=1;j<=n/i;j++)
p[i*j]=1;
}
g<<nr;
return 0;
}
