Pagini recente » Cod sursa (job #1122296) | Cod sursa (job #874683) | Cod sursa (job #2520360) | Cod sursa (job #681320) | Cod sursa (job #1599225)
#include <bits/stdc++.h>
using namespace std;
string z="oite.";
ifstream f(z+"in");
ofstream g(z+"out");
int C,L,i,j,rasp,v[1100];
unordered_map<int,int> m;
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 (m.find(L-v[i]-v[j])!=m.end())
rasp+=m[L-v[i]-v[j]];
for(j=i-1;j;--j)
m[v[i]+v[j]]++;
}
g<<rasp;
return 0;
}