Cod sursa(job #1365932)
Utilizator | Data | 28 februarie 2015 17:00:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
bool a[2000001];
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,i,j,nr=0;
f>>n;
for(i=1; i<=n; i++)
a[i]=1;
for(i=2; i<=n; i++)
if(a[i]==1)
{
nr++;
for(j=i*2; j<=n; j+=i)
a[j]=0;
}
g<<nr;
return 0;
}