Pagini recente » Cod sursa (job #1705610) | Cod sursa (job #699468) | Cod sursa (job #434789) | Cod sursa (job #2654452) | Cod sursa (job #478457)
Cod sursa(job #478457)
#include<fstream>
using namespace std;
int gcd (int a, int b);
int main()
{
ifstream f("pairs.in");
ofstream g("pairs.out");
int N,i,j,t,v[N];
t=0;
f>>N;
for (i=1;i<=N;i++)
f>>v[i];
for (i=1;i<N;i++)
for (j=i+1;j<=N;j++)
{
if (v[i]==v[j]) return 0;
if (gcd(v[i], v[j])==1) t++;
}
g<<t;
f.close();
g.close();
return 0;
}
int gcd (int a, int b)
{
int c;
while (b!=0)
{
c=a%b;
a=b;
b=c;
}
return a;
}