Cod sursa(job #2246624)
Utilizator | Data | 27 septembrie 2018 11:46:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int ciur[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
ciur[1]=1;
int i,j,k=0,n;
f>>n;
for (i=2; i<=n; i++)
{
if (ciur[i]==0)
{
for (j=2*i; j<=n; j=j+i)
{
ciur[j]=1;
}
}
}
for (i=1; i<n; i++)
{
if (ciur[i]==0) k++;
}
g<<"sunt "<<k<<" numere prime";
return 0;
}