Cod sursa(job #2673299)
Utilizator | Predescu Sebastian Ion PredescuSebastianIon | Data | 16 noiembrie 2020 14:21:22 |
---|---|---|---|
Problema | Oite | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int a[1030];
long long sol;
unordered_map<int,int> m;
int main()
{
ios_base::sync_with_stdio(false);
f.tie(0),g.tie(0);
int n,l;
f>>n>>l;
for(int i=1; i<=n; ++i)
{
f>>a[i];
}
sort(a+1,a+n+1);
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)
{
if(m.find(l-a[i]-a[j])!=m.end())
{
sol+=1LL*m[l-a[i]-a[j]];
}
}
}
g<<sol<<'\n';
return 0;
}