Sales by Match
unknown
c_cpp
a year ago
2.3 kB
3
Indexable
#include <bits/stdc++.h> using namespace std; string ltrim(const string &); string rtrim(const string &); vector<string> split(const string &); /* * Complete the 'sockMerchant' function below. * * The function is expected to return an INTEGER. * The function accepts following parameters: * 1. INTEGER n * 2. INTEGER_ARRAY ar */ int sockMerchant(int n, vector<int> ar) { int totalPair = 0; // create a vector which assigns socks to their index vector<int> sockCount; // reserve at least 100 spots sockCount.reserve(101); // create a for loop to assign these socks to the vector for(int i = 0; i < n; i++){ sockCount[ar[i]]++; } // create another for loop to check the loop for values >1 for(int i = 0; i < 101; i++){ // if (value > 1) divide by 2 and add to total if(sockCount[i] > 1){ totalPair += sockCount[i]/2; } } return totalPair; } int main() { ofstream fout(getenv("OUTPUT_PATH")); string n_temp; getline(cin, n_temp); int n = stoi(ltrim(rtrim(n_temp))); string ar_temp_temp; getline(cin, ar_temp_temp); vector<string> ar_temp = split(rtrim(ar_temp_temp)); vector<int> ar(n); for (int i = 0; i < n; i++) { int ar_item = stoi(ar_temp[i]); ar[i] = ar_item; } int result = sockMerchant(n, ar); fout << result << "\n"; fout.close(); return 0; } string ltrim(const string &str) { string s(str); s.erase( s.begin(), find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))) ); return s; } string rtrim(const string &str) { string s(str); s.erase( find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(), s.end() ); return s; } vector<string> split(const string &str) { vector<string> tokens; string::size_type start = 0; string::size_type end = 0; while ((end = str.find(" ", start)) != string::npos) { tokens.push_back(str.substr(start, end - start)); start = end + 1; } tokens.push_back(str.substr(start)); return tokens; }
Editor is loading...
Leave a Comment