Cod sursa(job #2157967)
Utilizator | Data | 10 martie 2018 08:01:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <string.h>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, nr=0;
f>>n;
bool fr[2000000];
memset(fr, 1, n);
for(int i=2; i<n; i++)
if(fr[i]==1)
{
nr++;
for(int j=2*i; j<n; j+=i)
fr[j]=0;
}
g<<nr;
return 0;
}