Cod sursa(job #2094996)
| Utilizator | Data | 26 decembrie 2017 20:00:32 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
int n;
bool euclid(int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
if(a==1)
return true;
else return false;
}
int rezolvare()
{
int s=0;
for(int p=1;p<=n;p++)
for(int q=1;q<=n;q++)
if(euclid(p, q))
s++;
return s;
}
int main()
{
FILE *f = fopen("fractii.in", "r");
fscanf(f,"%i",&n);
FILE *g = fopen("fractii.out", "w");
fprintf(g,"%d",rezolvare());
return 0;
}
