Cod sursa(job #1551073)
Utilizator | Data | 15 decembrie 2015 08:37:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
int n, prim[nmax], nr;
void read(){
ifstream f("ciur.in");
f >> n;
}
int main()
{
read();
for(int i=2; i<=n; i++)
prim[i] = 1;
for(int i=2; i<=n; i++)
if(prim[i]){
nr++;
for(int j=2*i; j <=n; j+=i)
prim[j] = 0;
}
ofstream g("ciur.out");
g << nr;
return 0;
}