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