Cod sursa(job #2247633)
Utilizator | Data | 28 septembrie 2018 21:06:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
ifstream ci ("ciur.in");
ofstream co ("ciur.out");
int n,h=0;
ci >> n;
int v[n+1];
for (int i=2; i<=n; i++)
{
v[i]=1;
}
for (int i=2; i<=n; i++)
{
if (v[i]==1)
{
for (int j=i+1; j<=n; j++)
{
if (j%i==0)
v[j]=0;
}
h++;
}
}
co << h << endl;
return 0;
}