Cod sursa(job #2825037)
Utilizator | Data | 3 ianuarie 2022 21:25:03 | |
---|---|---|---|
Problema | Oite | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <unordered_map>
#include <algorithm>
using namespace std;
unordered_map <int,int> m;
int i,j,l,n,a,sol,v[1026];
int main()
{
ifstream f ("oite.in");
ofstream g ("oite.out");
f>>n>>l;
for (i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for (i=1;i<=n;i++)
{
for (j=i+1;j<=n;j++) sol+=m[l-v[i]-v[j]];
for (j=1;j<i;j++) m[v[i]+v[j]]++;
}
g<<sol;
}