Comments

• 
  

  -1

  

  naipret  commented on Sept. 15, 2025, 2:41 p.m. ← edited →

  #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 target_sum;
    cin >> target_sum;
  
    int cnt = 0;
    for (int idx_i = 0; idx_i < num; idx_i++) {
      for (int idx_j = idx_i + 1; idx_j < num; idx_j++) {
        if (vec[idx_i] + vec[idx_j] == target_sum) {
          cnt++;
        }
      }
    }
  
    cout << cnt;
  }
  

• 
  

  1

  

  SteepMoleCules  commented on Aug. 10, 2025, 3:36 a.m.

  include <bits/stdc++.h>

  using namespace std;

  using ll = long long;

  long long X[1000001];

  int main(){

  int n; cin >> n;
  
  int a[n];
  
  for(int i = 0; i < n; i++){
  
      cin >> a[i];
  
  }
  int k;
  
  cin>>k;
  
  ll res = 0;
  
  for(int x : a){
  
      int r = k-x;
  
      if(r>=0&&r<=1000000){
  
          res += X[r];
      }
      X[x]++;
  }
  cout << res << endl;
  

  }

• 
  

  0

  

  id_07  commented on July 18, 2025, 9:20 a.m.

  CACH LAM BAI DEM CAP SO
  -TAO BIEN N,NHAP N,TAO BIEN DEM,DUYET MANG\
  -LAP 2 VONG I VA J BIEN J CAN LON HON I DE KO BI TRUNG
  
  #include <iostream>
  #include<cmath>
  #include <iomanip>
  using namespace std;
  
  int main() {
  int n;cin>>n;
  int a[n];
  for(int i = 0;i&lt;n;i++) cin>> a[i];
  
  int cap = 0;
  int k;cin>>k;
  for(int i = 0;i&lt;n;i++) {
      for(int j = i+1;j&lt;n;j++) {
          if(a[i] + a[j] == k) cap++;
      }
  }
  cout << cap;
  return 0;
  } 
  

• 
  

  -8

  

  NamKhanh187  commented on Feb. 14, 2025, 5:44 a.m.

  include <bits/stdc++.h>

  using namespace std; int arr[1001]; int main() { iosbase::syncwithstdio(false); cin.tie(NULL); unorderedmap<int, int> mp; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; mp[arr[i]]++; } int x; cin >> x; int count = 0; for (int i = 0; i < n; i++) { count += mp[x - arr[i]]; if (arr[i] * 2 == x) count--; } cout << count / 2; return 0; }

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

• 
  

  -9

  

  phnam212  commented on Jan. 6, 2025, 9:43 a.m.

  include<bits/stdc++.h>

  using namespace std;

  int check(int a[], int n, int k){ int cnt=0; for(int i=0;i<n-1;i++){ for(int j=i+1;j<n;j++){ if(a[i]+a[j]==k){ cnt+=1; } } } return cnt; }

  int main(){ int n;cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } int k;cin>>k; check(a,n,k); cout<<check(a,n,k); }

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

• 
  

  -17

  

  tansuperhot2010  commented on Sept. 23, 2024, 2:25 a.m.

  những thằng nghiện hiện lên và nói huhuhaha lambogini hay là rollroyle 2 người bạn đi dạo với nhau 1 anh bảo tối qua tôi sang nhà anh haha

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

• 
  

  -13

  

  tansuperhot2010  commented on Sept. 23, 2024, 2:23 a.m.

  huhuhaha

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

• 
  

  -14

  

  tansuperhot2010  commented on Sept. 23, 2024, 2:23 a.m.

  hỏi cc hahaha

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

• 
  

  -33

  

  Itachi  commented on April 30, 2024, 12:41 p.m.

  include<bits/stdc++.h>

  using namespace std;

  define ll long long;

  int main(){

  ios::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);
  int n,k;
  cin>>n;
  int a[n];
  for(int i=1;i<=n;i++){
      cin>>a[i];
  }
  cin>>k;
  int dem=0;
  for(int i=1;i<=n;i++){
      for(int j=i+1;j<=n;j++){
          if(a[i]+a[j]==k) dem++;
      }
  }
  cout<< dem;
  return 0;
  

  }

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