Cod sursa(job #2029991)
Utilizator | tudor P ptudor | Data | 30 septembrie 2017 19:19:26 |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a,int b)
{
int r;
if (b<a)
{
r=a;
a=b;
b=r;
}
while (b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n;
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
int i,j;
int s=0;
int aux=0;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
if (euclid(i,j)==1)
{
s++;
aux++;
out<<i<<"/"<<j<<" ";
}
out<<" f="<<aux<<"\n";
aux=0;
}
out<<"\n"<<"s="<<s;
}