Pagini recente » Cod sursa (job #2162493) | Cod sursa (job #1855349) | Cod sursa (job #2582646) | Cod sursa (job #3288982) | Cod sursa (job #1345231)
#include <stdio.h>
#include <stdlib.h>
int prime(int a, int b){
while (a != b){
if(a > b){
a = a - b;
} else{
b = b - a;
}
}
if (a == 1)
return 1;
return 0;
}
int nr_prime(int n, int p){
int nr = 0;
int i;
for(i = 1; i <= n; i ++){
if (prime(p,i))
nr++;
}
return nr;
}
int main()
{
int n;
int i,nr;
FILE *f = fopen("fractii.in","r");
FILE *g = fopen("fractii.out", "w");
fscanf(f,"%d",&n);
fclose(f);
nr = n; //vor fi cel putin n fractii de forma 1/1 1/2 ... 1/n
for(i = 2; i <= n; i++){
nr = nr + nr_prime(n,i);
}
fprintf(g,"%d",nr);
fclose(g);
return 0;
}