Cod sursa(job #1547608)
Utilizator | Data | 9 decembrie 2015 17:47:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool v[2000001];
int main()
{
int n,i,k,contor=0;
cin>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
contor++;
for(k=i+i;k<=n;k=k+i)
{
v[k]=1;
}
}
}
cout<<contor;
return 0;
}