Cod sursa(job #2002633)
Utilizator | Data | 20 iulie 2017 14:33:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
char v[3000001];
int main()
{
int n,cnt;
cin>>n;
cnt=0;
for(int i=2;i<=3000000;i++)
{
if(v[i]==1)
{
for(int j=2;j*i<=3000000;j++)
v[i*j]=1;
}
}
for(int i=2;i<=n;i++)
if(v[i]==0)
cnt++;
cout<<cnt;
return 0;
}