Cod sursa(job #1930104)
Utilizator | Data | 18 martie 2017 15:22:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,v[100000]={0},nr=0;
in>>n;
for (int i=2;i<=n;i++){
if (v[i]==0){
for (int j=2*i;j<=n;i++){
v[j]=1;
}
}
}
for (int i=1;i<=n;i++){
if (v[i]==0){
nr++;
}
}
out<<nr;
return 0;
}