Cod sursa(job #2638845)
| Utilizator | Data | 30 iulie 2020 10:44:00 | |
|---|---|---|---|
| Problema | Oite | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
unordered_map<int,int> m;
long long ans;
int a[1030];
int main()
{
int n,l;
in>>n>>l;
for(int i=1;i<=n;++i)
in>>a[i];
for(int i=3;i<n;++i)
{
for(int j=1;j<i-1;++j)
m[a[i-1]+a[j]]++;
for(int j=i+1;j<=n;++j)
ans+=1LL*m[l-a[i]-a[j]];
}
out<<ans<<'\n';
return 0;
}
