Cod sursa(job #2330776)
| Utilizator | Data | 28 ianuarie 2019 20:31:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[2000003];
int n;
int main()
{
int i,j,ct;
fin>>n;
fin.close();
c[2]=true;
for(i=3;i<=n;i=i+2)
c[i]=true;
for(i=3;i*i<=n;i=i+2)
if(c[i]==true)
for(j=3*i;j<=n;j=j+2*i)
c[j]=false;
ct=0;
for(i=2;i<=n;i++)
if(c[i]==true) ct++;
fout<<ct;
fout.close();
return 0;
}
