Comments

• 
  

  0

  

  L8_DuongThanhKhiem  commented on Nov. 22, 2025, 4:00 a.m.

  FULL AC:

  #include <bits/stdc++.h>
  using namespace std;
  const int oo = 1e9 + 7;
  short n;
  int demnho = 0,demlon = 0, x;
  vector <int> a;
  int main(){
      cin >> n;
      a.resize(n);
      for (int i = 0;i < n;i++)cin >> a[i];
      cin >> x;
      for (int i = 0;i < n;i++){
          if (a[i] < x)demnho++;
          if (a[i] > x)demlon++;
      }
      cout << demnho << endl;
      cout << demlon;
      return 0;
  }
  

• 
  

  0

  

  linh_2008123  commented on Oct. 21, 2025, 2:07 a.m.

  include<bits/stdc++.h>

  using namespace std; int main(){ iosbase::syncwith_stdio(false); cin.tie(NULL); int n;cin>>n; int a[n]; int great=0,small=0; for(int i=0;i<n;i++){ cin>>a[i]; } int x;cin>>x; for(int i =0;i<n;i++){ if(x<a[i]){ ++great; } else if(a[i]<x){ ++small; } } cout<<small<<"\n"; cout<<great<<"\n"; return 0; }

• 
  

  0

  

  naipret  commented on Sept. 15, 2025, 2:38 p.m.

  #include <iostream>
  #include <vector>
  
  using namespace std;
  
  int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  
    int num;
    cin >> num;
  
    vector<int> vec(num);
    for (int &ele : vec) {
      cin >> ele;
    }
  
    int threshold;
    cin >> threshold;
  
    int greater_than_threshold = 0, less_than_threshold = 0;
    for (int ele : vec) {
      if (ele > threshold) {
        greater_than_threshold++;
      }
      if (ele < threshold) {
        less_than_threshold++;
      }
    }
  
    cout << less_than_threshold << '\n';
    cout << greater_than_threshold;
  }
  

• 
  

  0

  

  quoctu  commented on Aug. 9, 2025, 2:39 a.m.

  include <bits/stdc++.h>

  include <algorithm>

  include <cmath>

  include <math.h>

  using namespace std;

  using ll = long long;

  int main() { ll n; cin >> n; int a[n]; for ( int i = 0; i < n; i++){ cin >> a[i]; } ll x; cin >> x; int sn = 0; int sl = 0; for ( int i = 0; i < n; i++){ if (a[i] < x ){ sn++; } else if ( a[i] > x){ sl++; } } cout << sn << endl; cout << sl; return 0; }

• 
  

  -1

  

  Pqvinh07072015555  commented on May 7, 2025, 3:47 p.m. ← edited →

  code python:

• 
  

  -11

  

  thanhnay29  commented on Feb. 13, 2025, 7:38 a.m.

  ngu lon

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

• 
  

  0

  

  nguyen_luong_an  commented on Dec. 18, 2024, 2:27 p.m.

  <3

• 
  

  -3

  

  mango_K  commented on Dec. 3, 2024, 3:12 p.m.

  bài này sai ở đâu ko mn,sao đúng đc 23 test vậy,

  include <bits/stdc++.h>

  using namespace std; int main() { int d1=0,d2=0; int n,x; cin>>n; int a[n]; for(int i=0;i<n;i++) cin >> a[i]; cin>>x; for(int i=0;i<n;i++){ if (a[i]<x) d1++; else if(a[i>x]) d2++; } cout<<d1<

• 
  

  2

  

  bengokyeuanh99  commented on April 18, 2025, 6:17 a.m.

  Lỗi logic cực nặng:

  else if(a[i > x]) d2++;

  i > x là biểu thức so sánh, trả về true (1) hoặc false (0)

  a[i > x] tương đương a[1] hoặc a[0] tức là bạn đang truy cập sai phần tử mảng, không phải so sánh a[i] > x

  In ra kết quả bị thiếu hoặc lỗi cú pháp:

  cout<<d1<

  Thiếu phần còn lại (<< và d2) compiler báo lỗi syntax, hoặc in không đủ kết quả sai output lỗi này dễ gặp khi viết nhanh, không check kỹ output

  Dùng mảng kiểu C:

  int a[n];

  Với n <= 1000 thì có thể chạy được, nhưng về mặt kỹ thuật: đây là VLA (Variable Length Array) không chuẩn C++, một số compiler không hỗ trợ

  dùng vector<int> a(n); an toàn, sạch, dễ bảo trì

• 
  

  -4

  

  ngocshintran  commented on Nov. 6, 2024, 10:49 a.m.

  CODE

  #include <bits/stdc++.h>
  
  using namespace std;
  
  int main() {
    int n,x;
    cin >> n;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    cin >> x;
    int min = 0, max = 0;
    for (int it : a) {
      if (it > x) max++;
      else if (it < x) min++;
    }
    cout << min << endl << max;
    return 0;
  }
  

• 
  

  -2

  

  Coder  commented on Sept. 26, 2024, 1:31 a.m.

  #include <iostream>

  using namespace std;

  int main() { int arr[10001]; int n; cin >> n;

  for(int i = 0; i < n; i++) {
      cin >> arr[i];
  }
  
  int x; 
  cin >> x;
  
  int min = 0; 
  int max = 0; 
  
  for(int i = 0; i < n; i++) {
      if(arr[i] < x) {
          min++;
      } else if(arr[i] > x) {
          max++;
      }
  }
  
  cout << min << endl;  
  cout << max;
  
  return 0;
  

  }

• 
  

  -8

  

  duy210  commented on Aug. 26, 2024, 5:37 p.m.

  anbtocom

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

• 
  

  -11

  

  theguy777_jaboi  commented on July 26, 2024, 8:33 a.m.

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  

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

• 
  

  -7

  

  dangkhoa2836  commented on July 25, 2024, 3:06 p.m.

  //góp vui một cách code OOP:333

  include <iostream>

  include <string>

  include <vector>

  include <cmath>

  include <iomanip>

  include <climits>

  class number { public: std::vector<int>vec;

  void xuly(int n, int x) {
      for (int i = 0; i < n; ++i) {
          if (vec[i] < x) {
              my_data[0]++;
          }
          else if (vec[i] > x) {
              my_data[1]++;
          }
      }
      std::cout << my_data[0] << "\n" << my_data[1];
  }
  

  private: int my_data[2]; };

  int main() { std::iosbase::syncwithstdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); int n; std::cin >> n; number* nt = new number; for (int i = 0; i < n; i++) { int x; std::cin >> x; nt->vec.pushback(x); } int x; std::cin >> x; nt->xuly(n, x); delete nt; }

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

• 
  

  -13

  

  bynk2311  commented on June 9, 2024, 10:11 a.m.

  include<bits/stdc++.h>

  define ll long long

  define se second

  define fi first

  define pb push_back

  define mp make_pair

  define ep emplace_back

  define EL cout << '\n';

  define sz(A) (int) A.size()

  define FOR(i,l,r) for (int i=l;i<=r;i++)

  define FOR(i,r,l) for (int i=r;i>=l;i--)

  define fillchar(a,x) memset(a, x, sizeof (a))

  define faster iosbase::syncwith_stdio(false); cin.tie(NULL); cout.tie(NULL);

  define MAX 20

  using namespace std;

  int main() { iosbase::syncwith_stdio(0); cin.tie(0); int n,a[1005],x,l=0,r=0; cin >> n; for(int i=0;i<n;i++) cin >> a[i]; cin >> x; for(int i=0;i<n;i++) { if(a[i]>x) l++; if(a[i]<x) r++; } cout << r << endl << l; return 0; }

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