fork(1) download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 50000;
  5.  
  6. int main() {
  7. int n, v[MAX_SIZE + 1];
  8. cin >> n;
  9. for (int i = 1; i <= n; ++i) {
  10. cin >> v[i];
  11. }
  12. int p = 2;
  13. while (p) {
  14. int x = v[n];
  15. for (int i = n - 1; i >= 1; --i) {
  16. v[i + 1] = v[i];
  17. }
  18. v[1] = x;
  19. --p;
  20. } /*
  21. for (int i = 1; i <= n; ++i) {
  22. cout << v[i] << " ";
  23. } */
  24. int k, currentNo;
  25. cin >> k;
  26. while (k) {
  27. cin >> currentNo;
  28. int left = 1, right = n, found = 0;
  29. int middle = (left + right) / 2;
  30. for (int i = 1; i <= n; ++i) {
  31. if (v[i] <= v[middle] && v[i] == currentNo) {
  32. cout << currentNo << " se gaseste in sir\n";
  33. found = 1;
  34. break;
  35. }
  36. if (v[middle] <= v[left] &&
  37. v[i] == currentNo && !found) {
  38. cout << currentNo << " se gaseste in sir\n";
  39. found = 1;
  40. }
  41. }
  42. if (!found) {
  43. cout << currentNo << " nu se gaseste in sir\n";
  44. }
  45. --k;
  46. }
  47. return 0;
  48. }
Success #stdin #stdout 0.01s 5280KB
stdin
7
5 12 15 17 20 2 4
6
7 9 1 2 17 15
stdout
7 nu se gaseste in sir
9 nu se gaseste in sir
1 nu se gaseste in sir
2 se gaseste in sir
17 nu se gaseste in sir
15 nu se gaseste in sir