Pagini recente » Rating Scarlat Alin (alin.scarlat25) | Cod sursa (job #1504302) | Solutii Unirea 2007 | Diferente pentru winter-challenge-2008/runda-2/solutii intre reviziile 11 si 12 | Cod sursa (job #2158214)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int n,k,t[100001];
int cmmdc(int x,int y)
{return (y)?cmmdc(y,x%y):x;}
int main()
{int i,j;
f>>n;
for(i=1;i<=n;i++)
f>>t[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(cmmdc(t[i],t[j])==1)
k++;
g<<k;
return 0;
}