Pagini recente » Cod sursa (job #471415) | Cod sursa (job #1622686) | Cod sursa (job #322) | Cod sursa (job #2300228) | Cod sursa (job #139975)
Cod sursa(job #139975)
#include <fstream.h>
#include <iostream.h>
int main()
{
fstream f,g;
long int n,x[100000],i,j,a,b;
f.open("pairs.in",ios::in);
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
f.close();
long int perechi=0;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
a=x[i];b=x[j];;
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
if(a==1)
perechi++;
}
g.open("pairs.out",ios::out);
g<<perechi;
g.close();
return 0;
}