Cod sursa(job #2252150)
| Utilizator | Data | 2 octombrie 2018 13:28:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
int n,ct; bool v[2000001];
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void Ciur(int);
int main()
{
fin>>n;
Ciur(n); ct=1;
for(int i=3;i<=n;i+=2) if(v[i]==0) ct++;
fout<<ct;
return 0;
}
void Ciur(int n)
{
v[1]=1;
for(int i=2;i<=n;i+=2) v[i]=1;
for(int i=3;i*i<=n;i+=2)
{
if(v[i]==0) for(int j=i;i*j<=n;j++) v[i*j]=1;
}
}
