Cod sursa(job #1388150)
Utilizator | Data | 15 martie 2015 11:17:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
int n, nr;
bool prime[nmax];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for(int i=2; i<=n; i++)
prime[i]=1;
for(int i=2; i<=n; i++)
if(prime[i]){
nr++;
for(int j=i+i; j<=n; j+=i)
prime[j]=0;
}
g << nr;
return 0;
}