Programming

std::vector<int> vec1;
vec1[0]=5; vec1[1]=5;

std::vector<int> occurs_twice;

for (i=0; i<vec1.size(); i++) {
   for (j=0; j<vec1.size(); j++) {
      if(vec1[i] == vec1[j]){
         occurs_twice.push_back(vec1[i]);
      }
   }
}

occurs_twice[0]=5;
occurs_twice[1]=5;
occurs_twice[2]=5;
occurs_twice[3]=5;

for (i=0; i<vec1.size(); i++) {
   for (j=0; j<vec1.size(); j++) {
      if(i != j && vec1[i] == vec1[j]){
         // check if vec1[i] is already on the list
         m = 0;
         for (k=0; k<occurs_twice.size(); k++) {
            if(occurs_twice[k] == vec1[i]){ m++; }
         }
         if(m == 0) { occurs_twice.push_back(vec1[i]); }
      }
   }
}

1,1,2,2,2,3,3 => 1,2,3  // duplicates appear consecutively 
1,2,3,1,2,3,1 => 1,2,3  // duplicates are spread over the vector

3,2,1,3,3,2,1 => 1,2,3  // unique, but not 3,2,1

1,2,3,5,2,3,12,3

1,5,12 => vector of elements that do not occur more than once
2,3 => separate vector vector of elements that do occur more than once

#include <map>
#include <iostream>

typedef std::map<int,int> list_t;
list_t list;

int
main()
{
   int x;
   do {
      std::cin >> x;
      if (x>=0) ++list[x];
   }
   while (x>=0);

   std::cout << "elements without duplicate :";
   for(list_t::iterator it=list.begin(); it!=list.end(); ++it) {
      if (it->second==1) std::cout << it->first << " ";
   }
   std::cout << std::endl;

   std::cout << "elements that have duplicate :";
   for(list_t::iterator it=list.begin(); it!=list.end(); ++it) {
      if (it->second>1) std::cout << it->first << " " ;
   }
   std::cout << std::endl;
}

std::map<std::string,int> iniMap() {
   std::map<std::string,int> typeMap;
   typeMap.insert(std::pair<std::string,int>("06-0-40-0000", 1)); // type 1
   typeMap.insert(std::pair<std::string,int>("06-1-30-1000", 2)); // type 2
   typeMap.insert(std::pair<std::string,int>("06-2-20-2000", 3)); // type 3
   typeMap.insert(std::pair<std::string,int>("06-3-10-3000", 4)); // type 4
   typeMap.insert(std::pair<std::string,int>("06-4-00-4000", 5)); // type 5
   return typeMap;
}


int checkType(std::string typeMapLookup) {
   static const std::map<std::string,int> typeMap = iniMap();
   const std::map<std::string,int>::const_iterator value = typeMap.find(typeMapLookup);
   if(value != typeMap.end()) {
      return value->second;
   }
   return -1; // type is not in the map
}