Cod sursa(job #1491030)
Utilizator | Data | 24 septembrie 2015 17:39:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n,i,j,nr=0;
in>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n/2;i++)
{
if(v[i]!=0)
{
for(j=i;j<=n/i;j++)
{
v[i*j]=0;
}
}
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
nr++;
}
out<<nr;
return 0;
}