Cod sursa(job #803394)
| Utilizator | Data | 27 octombrie 2012 15:02:42 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream fin ("pairs.in");
ofstream fout("pairs.out");
int a[100000],n,i,j,nr,x,y;
void citire()
{
fin>>n;
for(i=1;i<=n;i++)fin>>a[i];
}
int rezolvare()
{
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
x=a[i];y=a[j];
while(x!=y)
{
if(x>y)x=x-y;
else y=y-x;
}
if(x==1)nr++;
}
return nr;
}
void afisare()
{
fout<<nr;
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}