Submission #764220

#	Time	Username	Problem	Language	Result	Execution time	Memory
764220		vjudge1	Exam (eJOI20_exam)	C++17	0 / 100	3 ms	724 KiB

exam

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define forik(x) ll i = 1; i <= x; i++

const int mod = 1e9 + 7;

using namespace std;

ll n, k, p[100001], t[100001], a, b, c;
map <ll, ll> mp;

ll gcd (ll a, ll b){
	while (a > 0 && b > 0){
		if (a >= b){
			a %= b;
		}
		else{
			b %= a;
		}
	}
	return a + b;
}

ll binpow(ll a, ll b){
	a %= mod;
	if(b == 0){
		return 1;
	}
	if(b % 2 == 1){
		return binpow (a, b - 1) % mod * a;
	}
	if(b % 2 == 0){
		ll t = binpow(a, b / 2) % mod;
		return t * t % mod;
	}
}

signed main (){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
	cin >> p[i];
	mp[p[i]] = 1;
}
for (int i = 1; i <= n; i++){
	cin >> t[i];
}
for (int i = 1; i <= n; i++){
	if (mp[t[i]] > 0){
		a++;
	}
}
cout << a;
}

Compilation message (stderr)

exam.cpp: In function 'long long int binpow(long long int, long long int)':
exam.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
   43 | }
      | ^

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22