Pagini recente » Cod sursa (job #3285862) | Concursuri organizate de infoarena | Cod sursa (job #2752367) | Cod sursa (job #3134924) | Cod sursa (job #3276485)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ifstream fin("oite.in");
ofstream fout("oite.out");
const int Nmax=1050;
int a[Nmax];
unordered_map<int,int> tot;
signed main()
{
int n,L;
fin>>n>>L;
for(int i=1;i<=n;i++) fin>>a[i];
ll ans=0;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
int need=L-a[i]-a[j];
///cout<<i<<' '<<j<<' '<<need<<' '<<tot[need]<<'\n';
ans+=1LL*tot[need];
}
for(int j=1;j<i;j++)
{
tot[a[i]+a[j]]++;
}
}
fout<<ans<<'\n';
return 0;
}