Pagini recente » Cod sursa (job #3287225) | Cod sursa (job #3042221) | Cod sursa (job #3291146) | Cod sursa (job #1137724) | Cod sursa (job #1910083)
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll S,N,A[1050],rs;
unordered_map<ll,int> M;
int main(){
ifstream cin("oite.in");
ofstream cout("oite.out");
cin >> N >> S;
for(int i = 0;i<N;i++) cin >> A[i];
sort(A,A+N);
for(int i = 0;i<N;i++){
for(int j = i+1;j<N;j++) rs+=M[S-A[i]-A[j]];
for(int j = 0;j<i;j++) M[A[i]+A[j]]++;
}
cout << rs;
}