Cod sursa(job #2060035)
| Utilizator | Data | 7 noiembrie 2017 20:15:16 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,c[20000],j,k;
int main()
{
f>>n;
for(i=2;i<=n;i++)
c[i]=1;
for(i=2;i<=n;i++)
if(c[i]==1)
for(j=2;j*i<=n;j++)
c[i*j]=0;
for(i=2;i<=n;i++)
if(c[i]==1) k++;
g<<k;
return 0;
}
