Pagini recente » Cod sursa (job #1171110) | Cod sursa (job #636096) | Cod sursa (job #1861735) | Cod sursa (job #2978816) | Cod sursa (job #478454)
Cod sursa(job #478454)
#include<iostream>
#include<fstream>
using namespace std;
int gcd (int a, int b)
{
int c;
while (b!=0)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
ifstream f("pairs.in",ios::in);
ofstream g("pairs.out",ios::out);
int N,i,j,t,m[N][1];
t=0;
f>>N;
for (i=1;i<=N;i++)
f>>m[i][1];
for (i=1;i<N;i++)
for (j=i+1;j<=N;j++)
{
if (m[i][1]==m[j][1]) return 0;
if (gcd(m[i][1], m[j][1])==1) t++;
}
g<<t;
f.close();
g.close();
return 0;
}