Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- using namespace std;
- int main() {
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- int t;
- cin >> t;
- while (t--) {
- int n;
- cin >> n;
- vector<ll>v(n);
- ll a[n];
- for (int i=0; i<n; i++) {
- cin >> a[i];
- v[i]=a[i]*a[i]-a[i]*(i+1)+(i+1)*(i+1);
- }
- sort(v.begin(), v.end());
- ll ans=0;
- ll x=1;
- for (int i=1; i<n; i++) {
- if (v[i]!=v[i-1]) {
- ans+=x*(x-1)/2;
- x=1;
- }
- else x++;
- }
- ans+=x*(x-1)/2;
- cout << ans << endl;
- }
- return 0;
- }
- /* aj^2-aj.j+j^2 == ai^2-.ai.i+i^2
- * aj=ai && j=i XXX
- * aj=i && ai=j ---
- * aj2-aj.j=ai2-ai.i && i=j XXX
- * aj=ai && j(j-aj)=i(i-ai)
- * aj=i && j(j-aj)=ai(ai-i)
- * ai=j && i(i-ai)=aj(aj-j)
- */
Advertisement
Add Comment
Please, Sign In to add comment