Cod sursa(job #1954765)
| Utilizator | Data | 5 aprilie 2017 17:02:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ciur[2000000];
void buildCiur (int n)
{
ciur[0]=ciur[1]=1;
for (int i=2; i<=n; i++)
{
if (ciur[i]==0)
{
for (int j=2*i; j<=n; j+=i)
ciur[j]=1;
}
}
}
int main()
{
int n, cont=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
buildCiur(n);
for (int y=1; y<=n; y++)
{
if (ciur[y]==0)
cont++;
}
g<<cont;
return 0;
}
