Cod sursa(job #2377495)
Utilizator | Data | 10 martie 2019 13:49:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int a[n-2];
int c=0,i,k;
for (i=2;i<=n;i++)
{
if (a[i-2]==0)
{
c++;
k=i-2;
while (k<=n)
{
a[k]=1;
k=k+i;
}
}
}
g<<c++;
f.close();
g.close();
return 0;
}