Cod sursa(job #2973932)
Utilizator | David Curca divaddd | Data | 2 februarie 2023 20:26:48 |
---|---|---|---|
Problema | Oite | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define int long long
#define MAX 1030
using namespace std;
int n,x,v[MAX],cnt;
unordered_map<int, pair<int, int>> mp;
ifstream fin("oite.in");
ofstream fout("oite.out");
signed main()
{
fin >> n >> x;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
for(int i = 1; i <= n; i++){
for(int j = i+1; j <= n; j++){
int rest = x-v[i]-v[j];
if(mp.count(rest)){
cnt++;
}
}
for(int j = i-1; j >= 1; j--){
mp[v[i]+v[j]] = {i, j};
}
}
fout << cnt;
return 0;
}