Cod sursa(job #1469413)
Utilizator | Data | 8 august 2015 11:47:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define longc 2000005
using namespace std;
int verif[longc];
long long nr;
int main()
{
int n;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for (int i=2;i<=n;++i)
{
if (!verif[i])
{
++nr;
for (int j=i+i;j<=n;j+=i)
verif[j]=1;
}
}
printf("%lld",nr);
return 0;
}