Pagini recente » Cod sursa (job #2848090) | Cod sursa (job #1003646) | Cod sursa (job #2011386) | Cod sursa (job #2097569) | Cod sursa (job #2216846)
#include <fstream>
#include <map>
using namespace std;
ifstream cin ("oite.in");
ofstream cout ("oite.out");
const int NMAX = 1024;
int n, l;
int sol;
int v[1 + NMAX];
map <int, int> f;
int main() {
cin >> n >> l;
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int i = 1; i <= n; i++) {
for(int j = i + 1; j <= n; j++) {
if(v[i] + v[j] > l)
continue;
if(f[l - (v[i] + v[j])])
sol += f[l - (v[i] + v[j])];
}
for(int j = i - 1; j >= 1; j--)
f[v[i] + v[j]]++;
}
cout << sol;
return 0;
}