Cod sursa(job #2418282)
Utilizator | Data | 4 mai 2019 15:41:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include<cmath>
using namespace std;
int v[200005];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin>>n;
int nr=0;
v[0]=v[1]=1;
int i,j;
for(i=2;i<=n;i++)
if(!v[i]) {
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
fout<<nr;
return 0;
}