Найти количество содержащихся в массиве серий

1,[B] 5, 5, 5, 4, 4[/B], 5

int main()
{
    ifstream file("numbers.txt",ios::in);
    if (!file)
    {
        cerr<<"Oh shi";
        exit(100500);
    }
 
    int number1,number2;
    int combo=0;
 
    file>>number1>>number2;
    while(!file.eof())
    {
        if (number1==number2)
         combo++;
        number1=number2;
        file>>number2;
    }
    cout<<combo;
 
}

template <class iter>
size_t cnt_diff_seq(iter first, iter last) {
    size_t cnt=1;
    while (++first!=last)
        if (*first!=*(first-1)) cnt++;
 
    return cnt;
}
 
 
int main()
{
    int arr[10]={1,3,4,4,5,5,5,6,6,2};
    std::vector<int> vec(arr,arr+10);
 
    std::cout << cnt_diff_seq(vec.begin(),vec.end());
 
 
    std::cin.get();
    return 0;
}

#include <fstream>
#include <vector>
#include <algorithm>
#include <iterator>
using namespace std;
 
int main () {
 fstream io ("file.txt");
 vector<int> vec((istream_iterator<int>(io)), istream_iterator<int>());
 printf ("%d\n",unique(vec.begin(), vec.end())- vec.begin());
 getchar();
}

int mas [] = { 1, 5, 5, 5, 4, 4, 5};
int *it =mas;
unsigned result =0;
while ( it != mas + 8 ){
  it =std::adjacent_find ( it, mas + 7) + 1;
  result++;
}
std::cout << " Result : " << result << std::endl;

int mas [] = { 1, 5, 5, 5, 4, 4, 5, 5};

#include<iostream>
using namespace std;
 
bool pred (int x, int y) {
 return x!= y;
} 
 
int main(){
int mas [] = { 1, 5, 5, 5, 4, 4, 5, 5, 5, 5, 5, 5, 4};
//int mas [] = { 1, 2, 5, 5, 5, 4, 4, 5, 5, 5, 5, 5, 5};
//int mas [] = { 5, 5, 5, 5, 5, 5, 5, 5, 5};
int *it =mas;
int result =0;
while ( it <= &mas[sizeof(mas)/sizeof(int)]){
  it = adjacent_find (it, &mas[sizeof(mas)], pred)+ 1;
  result++;
}
std::cout << " Result : " << --result << std::endl;
getchar ();
}