Cod sursa(job #1818361)
Utilizator | Data | 29 noiembrie 2016 09:26:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, v[200000], app=0;
fin >> n;
for(int i=1;i<=n;i++) v[i]=1;
for(int i=2;i<=n;i++)
{
if(v[i]==1)
{
for(int j=i;j<=n/i;j++) v[i*j]=0;
}
}
for(int i=1;i<=n;i++)
{
if(v[i]==1) app++;
}
fout << app;
return 0;
}