Cod sursa(job #792224)
| Utilizator | Data | 26 septembrie 2012 19:37:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
long long int n;
char marcare[2 000 000];
int nr;
void rezolvare(){
for(int i=2;i<=n;i++)
if(marcare[i]=='0'){
nr++;
for(int j=i+i;j<=n;j+=i)
marcare[j]='1';
}
printf("%d",nr);
}
int main()
{
freopen("ciur,in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
rezolvare();
return 0;
}
