Cod sursa(job #3290460)
| Utilizator | Data | 30 martie 2025 19:28:54 | |
|---|---|---|---|
| Problema | Oite | Scor | 70 |
| 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 f("oite.in");
ofstream g("oite.out");
int v[1050];
map <int, int> m;
signed main ()
{
int n, l, ans=0;
f >> n >> l;
for (int i=1; i<=n; i++)
f >> v[i];
for (int i=1; i<=n; i++)
{
for (int j=i+1; j<=n; j++)
{
int s=v[i]+v[j];
ans+=m[l-s];
}
for (int j=1; j<i; j++)
{
int s=v[i]+v[j];
m[s]++;
}
}
g << ans;
}
