竞赛
考级
#include<iostream> using namespace std; const int N=2e5+20; int n,c; int vis[N],vvis[N]; int a[N]; int cnt; int main(){ cout<<cnt; return 0; }
199****2443
#include<bits/stdc++.h> using namespace std; typedef long long LL; LL a[200001]; map<LL,LL> m; //A-B=C --> A-C=B int main() { int n; LL c; LL ans=0; cin >> n >> c; for(int i=1;i<=n;i++) { cin >> a[i]; m[a[i]]; a[i]-=c; } for(int i=1;i<=n;i) ans+=m[a[i]]; cout << ans << endl; return 0; }
神降临C++
#include <iostream> #include <algorithm> #include <map> using namespace std; map <int, int> h; const int N = 2e5 + 10; int n, m, x, a[N], ans; int main(){ }
158****0253
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll a[200]; map<ll,ll> mp; int main(){ ll b,c,sum=0; cin>>b>>c; for(int i=0;i<b;i++){ cin>>a[i]; mp[a[i]]; a[i]=a[i]-c; } for(int i=0;i<b;i){ sum=sum+mp[a[i]]; } cout<<sum<<endl; return 0; }
Y神