Cod sursa(job #1202555)
Utilizator | Data | 28 iunie 2014 13:40:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int nr;
bool s[2000001];
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main ()
{
int n,i,j;
in >>n;
for (i=2;i<=n;i++)
{
if (s[i]==false)
{
nr++;
for (j=i;j<=n;j+=i)
s[j]=true;
}
}
out <<nr;
return 0;
}