This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub Harui-i/library
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B" #include "template/template.hpp" #include <vector> int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> s(n); for (int i = 0; i < n; i++) { cin >> s[i]; } int q; cin >> q; int cnt = 0; while (q--) { int t_i; cin >> t_i; cnt += binary_search(s.begin(), s.end(), t_i); } cout << cnt << endl; return 0; }
#line 1 "example.test.cpp" #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B" #line 1 "template/template.hpp" #include <iostream> #include <cassert> using namespace std; using ll = long long; template<class T> inline bool chmax(T& a, const T& b) {if (a<b) {a=b; return true;} return false;} template<class T> inline bool chmin(T& a, const T& b) {if (b<a) {a=b; return true;} return false;} const int INTINF = 1000001000; const int INTMAX = 2147483647; const ll LLMAX = 9223372036854775807; const ll LLINF = 1000000000000000000; #line 3 "example.test.cpp" #include <vector> int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> s(n); for (int i = 0; i < n; i++) { cin >> s[i]; } int q; cin >> q; int cnt = 0; while (q--) { int t_i; cin >> t_i; cnt += binary_search(s.begin(), s.end(), t_i); } cout << cnt << endl; return 0; }