topcode SRM 577 DIV2 EllysCoprimesDiv2

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class EllysCoprimesDiv2{
public:
int gcd(int x,int y){
while(x){
int r = x;
x = y%x;
y=r;
}
return y;
}
int getCount(vector<int> numbers){
sort(numbers.begin(),numbers.end());
int cnt = 0;
for(int i = 1; i < numbers.size(); i ++ ){
if(gcd(numbers[i-1],numbers[i]) != 1){
int j;
for(j = numbers[i-1]+1; j < numbers[i]; j ++ ){
if(gcd(numbers[i-1],j) == 1 && gcd(j,numbers[i]) == 1){
cnt += 1;
break;
}
}
if( j >= numbers[i]) cnt +=2;
}
}
return cnt;
}
};