Cod sursa(job #2981796)
Utilizator | Cinca David Andrei cincadavid | Data | 18 februarie 2023 18:54:32 |
---|---|---|---|
Problema | Oite | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
ifstream cin("oite.in");
ofstream cout("oite.out");
int main()
{
int n,l;
cin>>n>>l;
vector<int>v(n);
unordered_map<int,int>m;
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int res=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(m.count(v[i]+v[j]))
{
res+=m[v[i]+v[j]];
}
}
for(int j=i-1;j>=0;j--)
{
m[l-(v[i]+v[j])]++;
}
}
cout<<res;
return 0;
}