Cod sursa(job #1536941)
Utilizator | Data | 26 noiembrie 2015 19:49:18 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int eucli(int x,int y)
{
int z;
while(y)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
int n,k=1,i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
{
if(i<j)
{
if(eucli(i,j)==1)
k++;
}
else
if(eucli(j,i)==1)
k++;
}
g<<k;
f.close();
g.close();
return 0;
}