Cod sursa(job #1370036)
Utilizator | Dumitru Corneliu Corneliu10 | Data | 3 martie 2015 12:45:07 |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#define N 100004
using namespace std;
int v[N];
int cmmdc(int x,int y)
{
int z;
while(y)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
int p=0,i,n,j;
ifstream f("pairs.in");
ofstream g("pairs.out");
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] && cmmdc(v[i],v[j])==1)
p++;
g<<p;
}