Cod sursa(job #2036433)
Utilizator | Data | 10 octombrie 2017 18:01:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int main() {
int n, i, j, ok=0;
int prim = 0;
printf("Dati n:");
scanf("%d", &n);
for (i=1; i<=n; i++) {
ok=0;
for (j=1; j<=i; j++) {
if (i%j==0) {
ok++;
}
}
if (ok==2) {
prim++;
}
}
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
return 0;
}