forked from kilian-hu/hackerrank-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstub.cc
70 lines (46 loc) · 1.17 KB
/
stub.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'countPairs' function below.
*
* The function is expected to return a LONG_INTEGER.
* The function accepts INTEGER_ARRAY arr as parameter.
*/
long countPairs(vector<int> arr) {
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string arr_count_temp;
getline(cin, arr_count_temp);
int arr_count = stoi(ltrim(rtrim(arr_count_temp)));
vector<int> arr(arr_count);
for (int i = 0; i < arr_count; i++) {
string arr_item_temp;
getline(cin, arr_item_temp);
int arr_item = stoi(ltrim(rtrim(arr_item_temp)));
arr[i] = arr_item;
}
long result = countPairs(arr);
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;
}