Cod sursa(job #1554336)
| Utilizator | Data | 21 decembrie 2015 12:01:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <cstdio>
using namespace std;
char p[2000000];
void prim(int a,int l)
{
for(int d=a;d<=l;d=d+a)
p[d]=1;
}
int main()
{
int n,k=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
for(int i=2;i<=n;i++){
if(p[i]==0){
k++;
prim(i,n);
}
}
printf("%d", k);
return 0;
}
