Cod sursa(job #1493941)
| Utilizator | Data | 30 septembrie 2015 08:48:02 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define nmax 2000005
using namespace std;
bool seen[nmax];
int main(){
int n, nr= 0;
ifstream fin ("ciur.in");
fin >> n;
for(int i=4; i<=n; i+=2) seen[i]= true;
for(int i=3; i<=n; i+=2){
if(!seen[i]){
for(int j=i+i; j<=n; j+=i)
seen[j]= true;
}
}
for(int i=2; i<=n; i++)
if(!seen[i]) nr++;
ofstream fout("ciur.out");
fout << nr;
return 0;
}
