Comments

• 
  

  0

  

  bengokyeuanh99  commented on May 30, 2025, 6:59 p.m.

  include <cstdio>

  constexpr int MAXN = 1000000; int arr[MAXN];

  int main() { int n; if (scanf("%d", &n) != 1) return 1;

  for (int i = 0; i < n; ++i)
      if (scanf("%d", &arr[i]) != 1) return 1;
  
  for (int i = 0; i < n / 2; ++i)
      if (arr[i] != arr[n - 1 - i]) {
          puts("NO");
          return 0;
      }
  
  puts("YES");
  return 0;
  

  }

• 
  

  3

  

  VDev  commented on Jan. 18, 2025, 1:08 p.m.

  FULL AC

  #include <bits/stdc++.h>
  #include <iomanip>
  #include <cmath>
  #include <climits>
  #define ll long long
  using namespace std;
  ll a[10000011];
  ll cnt = 0, s = 0;
  
  int main(){
      ll n;
      cin >> n;
      bool check = true;
      for(ll i = 0; i < n; i++){
          cin >> a[i];
      }
      for(ll i = 0; i < n / 2; i++){
              if(a[i] != a[n - i - 1]){
                  check = false;
                  break;
              }
      }
      if(check){
              cout << "YES";
      }else{
           cout << "NO";
      }
      return 0;
  }
  

• 
  

  0

  

  tandatha140904  commented on Dec. 25, 2024, 4:50 p.m.

  include <bits/stdc++.h>

  using namespace std; int doixung(int a[], int n) { int mid = n / 2, i = 1, j = n; while (i <= mid && j > mid) { if (a[i] == a[j]) { i++; j--; } else return 0; } return 1; } int main() { int n; cin >> n; int a[n]; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (doixung(a, n)) { cout << "YES"; } else cout << "NO"; return 0; }

• 
  

  0

  

  dangsp07  commented on Dec. 12, 2024, 11:41 a.m.

  include <iostream>

  include <vector>

  using namespace std;

  int main() { int n; cin >> n; vector<int> a(n); for (int &x : a) cin >> x; for (int i = 0; i < n / 2; i++) { if (a[i] != a[n - i - 1]) { cout << "NO\n"; return 0; } }

  cout << "YES\n";
  return 0;
  

  }

• 
  

  0

  

  janekdao  commented on Nov. 30, 2024, 8:27 a.m.

  hay

• 
  

  -3

  

  ichingu  commented on Nov. 8, 2024, 12:50 p.m.

  

• 
  

  -6

  

  Nakbosstv  commented on Sept. 16, 2024, 3:00 p.m.

  .

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -8

  

  NTH11112222  commented on June 12, 2024, 2:55 p.m.

  include <bits/stdc++.h>

  using namespace std; int main() { int n,a[1000001]; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; bool kt=true; for(int i=0;i<n/2;i++){ if(a[i]!=a[n-i-1]){ kt=false; break; } } if(kt) cout<<"YES\n"; else cout<<"NO\n"; return 0; } Cho ai đang gặp kk nhé

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -9

  

  Itachi  commented on May 4, 2024, 3:10 p.m.

  include<bits/stdc++.h>

  using namespace std; int main(){ ios::syncwithstdio(false); cin.tie(0);cout.tie(0); int n; cin>>n; int a[n]; for(int i=1;i<=n;i++){ cin>>a[i]; } int j=n; bool check=true; for(int i=1;i<=n/2;i++){ if(a[i]!=a[j]) {check=false; break;} j--; } if(check==true) cout<<"YES"; else cout<<"NO"; return 0; }

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -17

  

  2vhoc7  commented on April 1, 2024, 4:17 p.m.

  if name == 'main': n = int(input()) a = list(map(int, input().split())) b = list(reversed(a))

  if a == b:
      print("YES")
  else:
      print("NO")
  

  This comment is hidden due to too much negative feedback. Show it anyway.