example.test.cpp

• View this file on GitHub
• Last update: 2023-07-08 14:12:19+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B"
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> s(n);
  REP(i, n) {
    cin >> s[i];
  }
  int q;
  cin >> q;
  int cnt = 0;
  while (q--) {
    int t_i;
    cin >> t_i;
    cnt += binary_search(ALL(s), 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"
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> s(n);
  REP(i, n) {
    cin >> s[i];
  }
  int q;
  cin >> q;
  int cnt = 0;
  while (q--) {
    int t_i;
    cin >> t_i;
    cnt += binary_search(ALL(s), t_i);
  }
  cout << cnt << endl;
  return 0;
}

Back to top page