Pagini recente » Cod sursa (job #449689) | Cod sursa (job #69571) | Cod sursa (job #257606) | Cod sursa (job #2866401) | Cod sursa (job #3199316)
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int v[1025];
unordered_map<long long,long long>m;
int main()
{
int n,s,i,j,x;
long long sum=0;
f>>n>>s;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
sum+=m[s-(v[i]+v[j])];
// g<<"i="<<i<<" j="<<j<<" val="<<m[s-(v[i]+v[j])]<<"\n";
}
if(i>=2)
for(j=1;j<i;j++)
m[v[i]+v[j]]++;
}
g<<sum;
}