Cod sursa(job #3209914)
Utilizator | Mironov Cezar Luca Carena | Data | 3 martie 2024 20:25:15 |
---|---|---|---|
Problema | Oite | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("oite.in");
ofstream cout("oite.out");
int v[(1<<10)+5];
unordered_map<int, int> f;
int main()
{
int c, l, ans=0;
cin>>c>>l;
for(int i=1;i<=c;i++)
cin>>v[i];
for(int i=1;i<c;i++)
{
for(int j=i+1;j<=c;j++)
if(f.find(l-v[i]-v[j])!=f.end())
ans+=f[l-v[i]-v[j]];
for(int j=1;j<i;j++)
f[v[i]+v[j]]++;
}
cout<<ans;
return 0;
}