Cod sursa(job #1491795)
Utilizator | Data | 26 septembrie 2015 10:21:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int p[2000001];
int main()
{
int n,nr=0;
freopen ("ciur.in","r",stdin);
freopen("ciur.out", "w", stdout);
scanf("%d",&n);
for (int i=2;i<=n;i++) p[i]=1;
for (int i=2;i<=n;i++)
if (p[i]!=0)
{
nr++;
for (int j=i;j<=n;j+=i) p[j]=0;
}
printf("%d\n", nr);
return 0;
}