Cod sursa(job #1893849)
Utilizator | Data | 26 februarie 2017 08:06:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool x[2000001];
int main()
{
ifstream f("ciur.in");ofstream g("ciur.out");
int i,j,n,nr=0;
f>>n;
x[0]=1;x[1]=1;
for (i=2;i<=n; i++)
if (x[i]==0)
{
nr++;
for(j=2*i; j<=n;j+= i)
x[j]=1;
}
g<<nr;
f.close();g.close();
return 0;
}