Pagini recente » Cod sursa (job #328478) | Cod sursa (job #286820) | Cod sursa (job #2675936) | Cod sursa (job #1370299) | Cod sursa (job #279882)
Cod sursa(job #279882)
#include <fstream.h>
ifstream f ("pairs.in");
long n,p[2],nr;
void read()
{
f>>n;
}
long m[100005];
void calc()
{
int a=p[0];
int b=p[1];
while(a!=b)
((a>b)?(a-=b):(b-=a));
if(a==1)
nr++;
}
void comb()
{
int i,j;
for(i=1;i<n;i++)
{
p[0]=m[i];
for(j=i+1;j<=n;j++)
if(m[i]!=m[j]&&m[i]>0&&m[j]>0)
{
p[1]=m[j];
calc();
}
}
}
int main()
{
int i;
read();
for(i=1;i<=n;i++)
f>>m[i];
f.close();
comb();
ofstream g ("pairs.out");
g<<nr;
g.close();
return 0;
}