fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. inline int power(int a, int b) {
  6. int x = 1;
  7. while (b) {
  8. if (b & 1) x *= a;
  9. a *= a;
  10. b >>= 1;
  11. }
  12. return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. void consistency(int n, int k) {
  27.  
  28. unordered_map<int,int> mp;
  29. int ans = 0;
  30. for(int i=0; i<n; i++){
  31. if(mp.count(a[i] - k)){
  32. ans += mp[a[i]-k];
  33. }
  34. mp[a[i]]++;
  35. }
  36. cout << ans << endl;
  37. }
  38.  
  39. void solve() {
  40.  
  41. a = {1, 5, 3, 4, 2};
  42. int n = a.size();
  43. int k = 2;
  44. consistency(n, k) ;
  45.  
  46. }
  47.  
  48.  
  49.  
  50.  
  51.  
  52. int32_t main() {
  53. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  54.  
  55. int t = 1;
  56. while (t--) {
  57. solve();
  58. }
  59.  
  60. return 0;
  61. }
Success #stdin #stdout 0.01s 5268KB
stdin
Standard input is empty
stdout
1