Cod sursa(job #1019727)
Utilizator | Data | 31 octombrie 2013 20:51:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr;
bool ok[2000001];
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
ok[i]=true;
}
nr=0;
for(i=2;i*i<=n;i++)
{
j=i;
while(j<=n/i)
{
ok[i*j]=false;
j++;
}
}
for(i=2;i<=n;i++)
if(ok[i]) nr++;
g<<nr;
return 0;
}