Pagini recente » Cod sursa (job #449636) | Cod sursa (job #537372) | Cod sursa (job #1690252) | Cod sursa (job #2315009) | Cod sursa (job #545892)
Cod sursa(job #545892)
#include <iostream.h>
#include <fstream.h>
int n,m[100000];
int cmmdc(int a, int b) {
int r;
r = a % b;
while(r != 0)
{
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ifstream fin("pairs.in");
fin>>n;
int nr=0;
for(int i=1; i<=n; i++)
fin>>m[i];
int i, j;
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
if(cmmdc(m[i], m[j]) == 1)
nr++;
ofstream fout("pairs.out");
fout<<nr;
}