Pagini recente » Cod sursa (job #1297641) | Borderou de evaluare (job #639783) | Atasamentele paginii Obmax | Diferente pentru problema/boundingbox intre reviziile 4 si 3 | Cod sursa (job #2200616)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,nr,ok,k,j,i;
int euclid(int a,int b)
{ int c;
while(b)
{
c=a%b;
a=b;b=c;
}
return a;
}
int main()
{ f>>n;
nr=n*(n-1)+1;
for(i=2;i<n;i++)
for(j=i+1;j<=n;j++)
if(euclid(i,j)!=1)nr=nr-2;
g<<nr;
}