#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int A[]={2,5};
int B[]={3,8};
int C[]={-5,8};
int D[]={5,10};
int E[]={-10,100};
int n=sizeof(A)/sizeof(A[0]);
int count=0;
unordered_map<int,int>m;
for(int i=0;i<n;i++){
m[E[i]]++;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
for(int l=0;l<n;l++){
int x=-(A[i]+B[j]+C[k]+D[l]);
int count=count+m[x];
}
}
}
}
cout<<"The no of tuplets are:"<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCiAgICBpbnQgQVtdPXsyLDV9OwogICAgaW50IEJbXT17Myw4fTsKICAgIGludCBDW109ey01LDh9OwogICAgaW50IERbXT17NSwxMH07CiAgICBpbnQgRVtdPXstMTAsMTAwfTsKICAgIGludCBuPXNpemVvZihBKS9zaXplb2YoQVswXSk7CiAgICBpbnQgY291bnQ9MDsKICAgIHVub3JkZXJlZF9tYXA8aW50LGludD5tOwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAJbVtFW2ldXSsrOwogICAgfQogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAJZm9yKGludCBqPTA7ajxuO2orKyl7CiAgICAJCWZvcihpbnQgaz0wO2s8bjtrKyspewogICAgCQkJZm9yKGludCBsPTA7bDxuO2wrKyl7CiAgICAJCQkJaW50IHg9LShBW2ldK0Jbal0rQ1trXStEW2xdKTsKICAgIAkJCQlpbnQgY291bnQ9Y291bnQrbVt4XTsKICAgIAkJCX0KICAgIAkJfQogICAgCX0KICAgIH0KICAgIGNvdXQ8PCJUaGUgbm8gb2YgdHVwbGV0cyBhcmU6Ijw8Y291bnQ7CglyZXR1cm4gMDsKfQ==