Cod sursa(job #1125516)
| Utilizator | Data | 26 februarie 2014 18:07:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
bool prim[nmax];
int n, sol;
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i=2; i<=n; i++) prim[i] = true;
for(int i=2; i<=n; i++)
if(prim[i])
for(int j=2*i; j<=n; j+=i) prim[j] = false;
for(int i=2; i<=n; i++) sol += prim[i];
g<<sol<<"\n";
return 0;
}
