Pagini recente » Cod sursa (job #1732899) | Cod sursa (job #2448238) | Rating marziali mattia (masecla22) | Cod sursa (job #1765636) | Cod sursa (job #641180)
Cod sursa(job #641180)
#include<stdio.h>
#include<unistd.h>
#include<math.h>
int is_prime(int n){
long i;
int c = 0;
if (n == 1 || n == 4 || n == 6)
return 0;
if (n == 2 || n == 3 || n == 5)
return 1;
if (n%2 == 0)
return 0;
long q=sqrt((long ) n);
for(i = 3; i <= q; i+=2){
if(n%i == 0)
return 0;
}
return 1;
}
int easy_sol(int N){
int i, c = 0;
for (i = 2; i < N ; i++){
if (is_prime(i))
c++;
}
return c;
}
int main(){
int N, M;
FILE* fin = fopen("ciur.in","r");
FILE* fout = fopen("ciur.out", "w");
fscanf(fin, "%d", &N);
//printf("N = %d\n ", N);
M = easy_sol(N);
//printf("M = %d\n", M);
fprintf(fout,"%d", M);
fclose(fin);
fclose(fout);
return 0;
}