Comments

• 
  

  0

  

  VDev  commented on Jan. 17, 2025, 3:23 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[1000011], s = 0, res = INT_MIN;
  
  int main(){
      ll n;
      cin >> n;
      for(ll i = 1; i <= n; i++){
          cin >> a[i];
      }
      for(ll i = 1; i <= n; i++){
          cnt[a[i]]++;
          if(a[i] > res){
              res = a[i];
          }
      }
      for(ll i = 0; i <= res; i++){
          if(cnt[i]){
              cout << i << " " << cnt[i] << endl;
          }
      }
      return 0;
  }
  

• 
  

  0

  

  tranhoang11111  commented on Jan. 22, 2025, 2:22 p.m.

  ông để ngta động não đi chứ :))

• 
  

  -1

  

  VDev  commented on Jan. 26, 2025, 5:05 p.m.

  ay da chợt nhận ra quen tay bố ròi, mà tui code ở c++11 mà ng ta dùng cái khác hay sao mà tui bị -5 đánh giá, hay là do tui nhét code nên downvote vì gửi code :))

• 
  

  -5

  

  VuxPerfect  commented on June 9, 2024, 3:00 a.m.

  include <iostream>

  include <algorithm>

  using namespace std;

  const int MAXSIZE = 1000001; int mark[MAXSIZE];

  int main() { int n; cin >> n;

  int a[n];
  for (int i = 0; i < n; i++) {
      cin >> a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < MAX_SIZE; i++) {
      mark[i] = 0;
  }
  for (int i = 0; i < n; i++) {
      mark[a[i]]++;
  }
  for (int i = 0; i < n; i++) {
      if (mark[a[i]] > 0) {
          cout << a[i] << " " << mark[a[i]] << endl;
          mark[a[i]] = 0; 
      }
  }
  return 0;
  

  }

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

• 
  

  -11

  

  ken123  commented on May 16, 2024, 1:11 p.m.

  fdgg

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