Cod sursa(job #2627991)
Utilizator | Moise Andrei Moise_Andrei | Data | 13 iunie 2020 19:46:44 |
---|---|---|---|
Problema | Oite | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
int v[1005], s;
unordered_map <int, int> mp;
int32_t main()
{
int n, k;
in >> n >> k;
for(int i = 1; i <= n; i ++)
in >> v[i];
sort(v + 1, v + n + 1);
for(int i = 1; i <= n; i ++)
{
for(int j = i + 1; j <= n; j ++)
s += mp[k - v[i] - v[j]];
for(int j = 1; j < i; j ++)
mp[v[i] + v[j]] ++;
}
out << s;
return 0;
}