Cod sursa(job #1113120)
Utilizator | Data | 20 februarie 2014 12:44:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool a[2000005];
int main()
{
int n,k=0,j,i;
cin>>n;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
k++;
for(j=i+i;j<=n;j=j+i)
a[j]=1;
}
}
cout<<k;
}