Pagini recente » Cod sursa (job #2853681) | Istoria paginii runda/21312/clasament | Cod sursa (job #1860841) | Cod sursa (job #1143601) | Cod sursa (job #1132917)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long ma(long a,long b)
{ int r;
r=a%b;
while(r){a=b;b=r;r=a%b;}
return b;
}
int main()
{
int a[100],i,n,j,nr=0;
f>>n;
for(i=0;i<=n-1;i++)
a[i]=i+1;
for(i=0;i<=n-1;i++)
for(j=0;j<=n-1;j++)
if(ma(a[i],a[j])==1)
nr++;
g<<nr;
return 0;
}