Cod sursa(job #805663)
| Utilizator | Data | 31 octombrie 2012 21:12:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
int i, cate=1;
scanf("%d", &n);
for( i=3; i <= n ; i++)
if( (i%2!=0 && i%3!=0 && i%5!=0 && i%7!=0) || i==2 ||i==3 ||i==5||i==7)
// cout << i << " ",
cate++;
printf("%d", cate);
return 0;
}
