Playground
//koristi C++11 - http://mendo.mk/Lecture.do?id=26 #include <iostream> #include <unordered_set> #include <unordered_map> #include <vector> using namespace std; int main() { vector<int> numbers = {1, 2, 3, 4, 5, 1, 2, 3, 4, 5}; unordered_set<int> different; unordered_map<int, int> occurrences; for(auto number : numbers) { different.insert(number); occurrences[number]++; } //different = [1, 2, 3, 4, 5] cout << different.size() << endl; //5 //occurrences[1] = 2, occurrences[2] = 2, ... cout << occurrences[1] << endl; //2 return 0; }
Input data
Program output
Execute
Language: ????????? | Memory: ???? KB | Time: ??? ms
Nothing has been executed, yet!