Cod sursa(job #3254494)
Utilizator | Data | 7 noiembrie 2024 17:23:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int N, x = 2, nr =1, d,cnt=0;
FILE *r, *w;
r=fopen("ciur.in", "r");
w=fopen("ciur.out", "w");
fscanf(r, "%d", &N);
while(x<=N){
nr=1;
d=2;
while(d<x){
if(x%d==0){
nr=0;
d=x;
}
d++;
}
x++;
if(nr){
cnt++;
}
}
fprintf(w, "%d", cnt);
return 0;
}