Cod sursa(job #1498713)
| Utilizator | Data | 8 octombrie 2015 22:57:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main ()
{
long N,k;
bool v[2000001];
ifstream cin("ciur.in");
ofstream cout("ciur.out");
k=0;
cin>>N;
for(int i=2;i<=N;i++)
{
v[i]=1;
}
for(int i=2;i<=N;i++) {
if (v[i]!=0)
{
k++;
for(int j=2*i;j<=N;j+=i)
{
v[j]=0;
}
}
}
cout<<k;
}