Pagini recente » Cod sursa (job #418227) | Cod sursa (job #3165233) | Cod sursa (job #2266750) | Cod sursa (job #570103) | Cod sursa (job #651111)
Cod sursa(job #651111)
#include<fstream>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int cmmdc(int a, int b)
{
while(a!=b)
{
while(a>b)a=a-b;
while(a<b)b=b-a;
}
return a;
}
int main()
{
int i,j,n,a[100000],k=0;
fin>>n;
for(i=1;i<=n;i++)fin>>a[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(cmmdc(a[i],a[j])==1)k++;
fout<<k;
fin.close();
fout.close();
return 0;
}