Cod sursa(job #1791241)
| Utilizator | Data | 29 octombrie 2016 11:04:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
char ar[2000005];
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);
int N;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
int i, j;
int p{0};
for (i=2;i<=N;i++)
ar[i] =1;
for (i = 2; i <= N; i++)
{ if (ar[i])
{ p++;
for (j = i+i; j <= N; j+=i)
ar[j] = 0;
}
}
//for (i = 1; i <= N; i++)
// if (ar[i]) p++;
printf("%d\n",p);
return 0;
}
