Cod sursa(job #1783864)
Utilizator | Data | 19 octombrie 2016 16:00:31 | |
---|---|---|---|
Problema | Oite | Scor | 90 |
Compilator | cpp | Status | done |
Runda | hash_excelenta | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int C,L,i,j,sol,v[1<<11];
unordered_map <int,int> H;
int main()
{
f>>C>>L;
for(i=1;i<=C;++i) f>>v[i];
for(i=1;i<C;++i)
{
for(j=i+1;j<=C;++j)
if(L-v[i]-v[j]>0)
sol+=H[L-v[i]-v[j]];
for(j=1;j<i;++j)
H[v[i]+v[j]]++;
}
g<<sol;
return 0;
}