Pagini recente » Cod sursa (job #685284) | Cod sursa (job #2371212) | Cod sursa (job #317336) | Cod sursa (job #2446986) | Cod sursa (job #58275)
Cod sursa(job #58275)
#include <stdio.h>
#include <ext/hash_map>
#include <vector>
using namespace std;
#define in "oite.in"
#define out "oite.out"
#define dim 1025
using namespace __gnu_cxx;
int N, L, total=0;
int V[dim];
hash_map<int,int> M;
int main()
{
freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d%d", &N, &L);
for ( int i = 1; i <= N; i++ )
{
scanf("%d", &V[i]);
}
for ( int i = 3; i <= N; i++ )
{
for ( int j = 1; j < i-1; j++ )
M[V[i-1]+V[j]]++;
int K = L - V[i];
for ( int j = i+1; j <= N; j++ )
{
if ( K - V[j] >= 0 ) total += M[K-V[j]];
}
}
printf("%d", total);
}