Cod sursa(job #1911331)
Utilizator | Data | 7 martie 2017 20:11:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,k,j;
bool c[1000000];
int main()
{
cin>>n;
for(i=2;i<=n;i++){
if(c[i]==0)k++;
if(i==2||i%2!=0){
for(j=i;j<=n;j=j+i)
c[j]=1;
}
}
cout<<k;
return 0;
}