Cod sursa(job #1159002)
Utilizator | Data | 29 martie 2014 11:22:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int n, i, j, c;
bool a[2000000];
int main()
{
fi>> n;
for(i=2; i<=n; i++)
a[i]=1;
for(i=2; i<=n; i++)
{
if(a[i])
{
c++;
for(j=i*2; j<=n; j+=i)
a[j]=0;
}
}
fo<<c;
return 0;
}