fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 50000;
  5.  
  6. int main() {
  7. int n, x, v[MAX_SIZE + 1], check[MAX_SIZE + 1];
  8. cin >> n;
  9. for (int i = 1; i <= n; ++i) {
  10. cin >> v[i];
  11. }
  12. cin >> x;
  13. for (int j = 1; j <= x; ++j) {
  14. cin >> check[j];
  15. }
  16. //int left = 1, right = n,;
  17. for (int j = 1; j <= x; ++j) {
  18. for (int i = 1; i <= n; ++i) {
  19. if (v[i] == check[j]) {
  20. cout << check[j] << " se afla in sir \n";
  21. } else {
  22. cout << check[j] <<" nu se afla in sir \n";
  23. }
  24. }
  25. }
  26. return 0;
  27. }
Success #stdin #stdout 0s 5276KB
stdin
7
5 12 15 17 20 2 4
4
1 15 5 7
stdout
1 nu se afla in sir 
1 nu se afla in sir 
1 nu se afla in sir 
1 nu se afla in sir 
1 nu se afla in sir 
1 nu se afla in sir 
1 nu se afla in sir 
15 nu se afla in sir 
15 nu se afla in sir 
15 se afla in sir 
15 nu se afla in sir 
15 nu se afla in sir 
15 nu se afla in sir 
15 nu se afla in sir 
5 se afla in sir 
5 nu se afla in sir 
5 nu se afla in sir 
5 nu se afla in sir 
5 nu se afla in sir 
5 nu se afla in sir 
5 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir 
7 nu se afla in sir