Cod sursa(job #1348291)
| Utilizator | Data | 19 februarie 2015 17:00:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool v[2000002];
int main()
{
int n,i,j;
long long nr=0;
cin>>n;
for(i=0;i<n;i++)
{
v[i]=true;
}
for(i=2;i<n;i++)
{
if(i<=sqrt(n) && v[i]==true)
{
for(j=i*i;j<n;j++)
{
if(j%i==0)
{
v[j]=false;
}
}
}
}
for(i=2;i<n;i++)
{
if(v[i]==true)
{
nr++;
}
}
cout<<nr;
return 0;
}
