Cod sursa(job #2143461)
Utilizator | Data | 25 februarie 2018 23:14:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n, v[100000];
bool prim(int n)
{
int i;
for(i=2; i<=n/2; i++)
{
if(n%i==0)
{
return 0;
}
}
return 1;
}
int main()
{
int i, j, nr=0;
in>>n;
for(i=2; i<=n; i++)
{
if(prim(i))
{
nr++;
for(j=i+i; j<=n; j+=i)
{
v[j]=1;
}
}
}
out<<nr;
return 0;
}