Comments

• 
  

  0

  

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

  <3

• 
  

  -1

  

  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<

• 
  

  0

  

  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;
  }
  

• 
  

  -1

  

  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;
  

  }

• 
  

  -6

  

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

  anbtocom

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

• 
  

  -9

  

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

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  ---

  

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

• 
  

  -5

  

  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.

• 
  

  -12

  

  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.