Cod sursa(job #2352004)
Utilizator | Data | 22 februarie 2019 21:24:33 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int m[100000];
int ok(int a,int b)
{
while(a!=b)
if(a>b)
a-=b;
else
b-=a;
return a;
}
int main()
{
int n,ct=0;
f>>n;
for(int i=0;i<n;i++)
f>>m[i];
for(int i=0;i<n-1;i++)
for(int j=i;j<n;j++)
if(m[i]!=m[j])
if(ok(m[i],m[j])==1)
ct++;
g<<ct;
}