５４６ｔｒｔ · 发布于 2025-07-13 · 浏览 381 回复 0

int n, f = 0, k;
cin >> n;
long long a[n];

for (int i = 0; i < n; i++) {

	cin >> a[i];
}

cin >> k;

for (int i = n - 1; i >= 0; i--) {

	if (a[i] == k) {
		f++;
	}
}

cout << f;
return 0;