-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path6-10.cpp
48 lines (41 loc) · 1.18 KB
/
6-10.cpp
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
#include "middle_list.h"
long long itc_sum_even_lst(const vector<int>& lst) {
long long sum = 0;
for (int i = 0; i < lst.size(); i += 2) {
sum += lst[i];
}
return sum;
}
long long itc_sum_even_part_lst(const vector<int>& lst) {
long long sum = 0;
for (int i = 0; i < lst.size(); i++) {
if (lst[i] % 2 == 0)
sum += lst[i];
}
return sum;
}
void itc_odd_even_separator_lst(const vector<int>& lst,
vector<int>& lst1,
vector<int>& lst2) {
for (int i = 0; i < lst.size(); i++) {
if (lst[i] % 2 == 0) {
lst1.push_back(lst[i]);
} else {
lst2.push_back(lst[i]);
}
}
}
void itc_pos_neg_separator_lst(const vector<int>& lst,
vector<int>& lst1,
vector<int>& lst2,
vector<int>& lst3) {
for (int i = 0; i < lst.size(); i++) {
if (lst[i] < 0) {
lst1.push_back(lst[i]);
} else if (lst[i] == 0) {
lst2.push_back(lst[i]);
} else if (lst[i]>0) {
lst3.push_back(lst[i]);
}
}
}