CF1598C. Delete Two Elements 1200——思维

CF1598C

题意：

给出n个数，问有多少对数，使得删掉这对数后剩下数的平均数和原先相同

思路：

设sum表示原来所有数的和，则平均数为sum/n,即只要两个数相加为2sum/n即可凑成一对

考虑把每个数*n，则和为2sum。通过map实现

// Decline is inevitable,
// Romance will last forever.
//#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <vector>
using namespace std;
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
//#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define int long long
const int maxn = 3e2 + 10;
const int maxm = 1e3 + 10;
const int P = 1e4 + 7;
void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    ll sum = 0;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    ll ans = 0;
    map<ll, ll> mp;
    for(int i = 0; i < n; i++) {
        ans += mp[1ll * n * a[i]];
        mp[2ll * sum - 1ll * n * a[i]]++;
    }
    cout << ans << '\n';
}
signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//    int T; scanf("%d", &T); while(T--)
//    freopen("1.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    int T; cin >> T;while(T--)
    solve();
    return 0;
}