Cod sursa(job #2978851)
Utilizator | Alex Birsan Zed1Yasuo | Data | 14 februarie 2023 16:01:37 |
---|---|---|---|
Problema | Oite | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <unordered_map>
#include <algorithm>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,k;
int a[1100],sol;
unordered_map<int,int>h;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for(int i=2;i<=n-2;i++)
{
for(int j=1;j<i&&a[i]+a[j]<=k;j++)
h[a[i]+a[j]]++;
for(int j=i+2;j<=n;j++)
if(h.find(k-a[i+1]-a[j])!=h.end())
sol+=h[k-a[i+1]-a[j]];
}
g<<sol;
return 0;
}