-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBetweenTwoSets.cpp
More file actions
113 lines (81 loc) · 2.24 KB
/
BetweenTwoSets.cpp
File metadata and controls
113 lines (81 loc) · 2.24 KB
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
typedef long long ll;
/*
* Complete the getTotalX function below.
*/
int getTotalX(vector<int> a, vector<int> b) {
int maxi=*(max_element(a.begin(),a.end()));
//cout<<maxi<<endl;
int c=0;
for(ll i=1;i<=100;i++)
{
bool istrue=true;
for(auto x:a)
if(i%x!=0)
{
istrue=false;
break;
}
if(istrue==false)
continue;
for(auto x:b)
if(x%i!=0)
{
istrue=false;
break;
}
c+=(istrue);
}
return c;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string nm_temp;
getline(cin, nm_temp);
vector<string> nm = split_string(nm_temp);
int n = stoi(nm[0]);
int m = stoi(nm[1]);
string a_temp_temp;
getline(cin, a_temp_temp);
vector<string> a_temp = split_string(a_temp_temp);
vector<int> a(n);
for (int a_itr = 0; a_itr < n; a_itr++) {
int a_item = stoi(a_temp[a_itr]);
a[a_itr] = a_item;
}
string b_temp_temp;
getline(cin, b_temp_temp);
vector<string> b_temp = split_string(b_temp_temp);
vector<int> b(m);
for (int b_itr = 0; b_itr < m; b_itr++) {
int b_item = stoi(b_temp[b_itr]);
b[b_itr] = b_item;
}
int total = getTotalX(a, b);
fout << total << "\n";
fout.close();
return 0;
}
vector<string> split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});
input_string.erase(new_end, input_string.end());
while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}
vector<string> splits;
char delimiter = ' ';
size_t i = 0;
size_t pos = input_string.find(delimiter);
while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));
i = pos + 1;
pos = input_string.find(delimiter, i);
}
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
return splits;
}