Cod sursa(job #1910000)
Utilizator | Data | 7 martie 2017 15:04:49 | |
---|---|---|---|
Problema | Oite | Scor | 70 |
Compilator | cpp | Status | done |
Runda | lasm07.03.2017 | Marime | 0.42 kb |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll S,N,A[1050],rs;
map<ll,ll> 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;
}