Pagini recente » Cod sursa (job #2349849) | Cod sursa (job #2157763) | Cod sursa (job #2941056) | Cod sursa (job #284073) | Cod sursa (job #367582)
Cod sursa(job #367582)
#include <fstream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
long int Cmmdc(long int ,long int );
long int x[10000], n, q;
int nr;
int main()
{
fin >> n;
for ( int i = 0; i < n; ++i )
fin >> x[i];
for ( int i = 0; i < n-1; ++i )
for ( int j = i+1; j < n; ++j )
{
q = Cmmdc ( x[i], x[j] );
if ( q == 1 )
nr++;
}
fout << nr<< '\n';
fin.close();
fout.close();
}
long int Cmmdc(long int a, long int b)
{
if ( b == 0 ) return a;
int rest;
do
{
rest = a % b;
a = b;
b = rest;
} while ( rest );
return a;
}