Pagini recente » Cod sursa (job #1450757) | Cod sursa (job #169558) | Cod sursa (job #1444957) | Cod sursa (job #3271004) | Cod sursa (job #2973933)
#include <bits/stdc++.h>
#define int long long
#define MAX 1030
using namespace std;
int n,x,v[MAX],cnt;
unordered_map<int, int> mp;
ifstream fin("oite.in");
ofstream fout("oite.out");
signed main()
{
fin >> n >> x;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
for(int i = 1; i <= n; i++){
for(int j = i+1; j <= n; j++){
int rest = x-v[i]-v[j];
if(mp.count(rest)){
cnt += mp[rest];
}
}
for(int j = i-1; j >= 1; j--){
mp[v[i]+v[j]]++;
}
}
fout << cnt;
return 0;
}