Cod sursa(job #3291653)
| Utilizator | Data | 5 aprilie 2025 11:19:33 | |
|---|---|---|---|
| Problema | Oite | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | cex_9 | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("oite.in");
ofstream fout ("oite.out");
unordered_map <int,int> mp;
int n, s, v[1024];
int main()
{
fin >> n >> s;
for (int i=1; i<=n; i++)
fin >> v[i];
int rez=0;
for (int i=1; i<=n; i++)
{
for (int j=i+1; j<=n; j++)
rez+=mp[s-v[i]-v[j]];
for (int j=1; j<i; j++)
mp[v[i]+v[j]]++;
}
fout << rez;
return 0;
}
