Comments

• 
  

  0

  

  cocomelon_0202  commented on Jan. 14, 2025, 9:53 a.m.

  include <bits/stdc++.h>

  using namespace std;

  define rw(name) if (fopen(name".inp", "r")) freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout)

  define ll long long

  define el "\n"

  define ios iosbase::syncwith_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

  const ll maxn=1e7;

  ll x,n, minn;

  int main() { ios; rw("test");

  cin>>n;
  
  map<ll,ll> mp;
  minn=LLONG_MAX;
  for (ll i=1; i<=n; i++) cin>>x, mp[x]++, minn=min(minn, x);
  
  cout<&lt;mp[minn];
  
  
  
  return (0^0);
  

  }

• 
  

  0

  

  Bondy002008  commented on Sept. 16, 2024, 6:36 a.m.

  include<bits/stdc++.h>

  using namespace std;

  int main() { int n,j=0,d=1; cin>>n; int a[n]; for (int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n); for (int i=0;i<n;i++){ if (a[i]==a[i+1])d++; else break; } cout<<d; } Code tui như này nè

• 
  

  -1

  

  Zzbopro123Zz  commented on July 13, 2024, 3:24 p.m.

  include <bits/stdc++.h>

  using namespace std; int findmin(const vector<int> &arr) { int minvalue = numericlimits<int>::max(); for (int num : arr) { if (num < minvalue) { minvalue = num; } } return minvalue; } int main() { iosbase::syncwithstdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; ++i) { cin >> arr[i]; } int minvalue = findmin(arr); int count = 0; for (int i = 0; i < n; i++) { if (arr[i] == minvalue) { count++; } } cout << count << endl; return 0; } code của tui kiểu :< sao có thể ngắn như mn được nhỉ

• 
  

  -1

  

  PhamBaDat_k5  commented on May 25, 2024, 3:35 a.m.

  include <bits/stdc++.h>

  using namespace std; int main() { int n; cin >> n; int a[3000]; for (int i = 0; i < n; i++) { cin >> a[i]; } int cnt = 0; int res = INT_MAX; for (int i = 0; i < n; i++) { if (a[i] < res) { cnt = 0; res = a[i]; } if (a[i] == res) { cnt++; } } cout << cnt <<endl;

  return 0;
  

  }

  Code tui như này .-.

• 
  

  -4

  

  NTH11112222  commented on May 25, 2024, 2:58 a.m.

  include <iostream>

  include <vector>

  include <algorithm>

  using namespace std; int main() { int N; cin >> N; vector<int> A(N); for (int i = 0; i < N; ++i) { cin >> A[i]; } int minVal = *min_element(A.begin(), A.end()); int minCnt = count(A.begin(), A.end(), minVal); cout << minCnt << endl; return 0; }

  Tham khảo chứ đừng chép nha

• 
  

  -1

  

  long_674  commented on May 10, 2024, 6:58 a.m.

  ai xem giups bai minh sai gif khong,testcase dung 30/31

• 
  

  -1

  

  Malaze_KL  commented on June 4, 2024, 6:17 a.m.

  min = -10000 ông bỏ dấu trừ đi; if(a[i]<=min) min=a[i]; mới đúng nhé

• 
  

  -1

  

  Malaze_KL  commented on June 4, 2024, 6:00 a.m.

  hmm