Cod sursa(job #2242044)
Utilizator | Data | 17 septembrie 2018 17:29:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k=0,c[2000001];
void ciur()
{int i,j;
for (i=4;i<=n;i+=2)
{c[i]=1;k--;}
for (i=3;i*i<=n;i+=2)
if (c[i]==0)
for (j=i*i;j<=n;j+=i)
{c[j]=1;k--;}
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
k=n-1;
ciur();
out<<k<<"\n";
}