Pagini recente » Borderou de evaluare (job #2779089) | Diferente pentru problema/fmcm intre reviziile 10 si 9 | Cod sursa (job #1569623) | Cod sursa (job #1260677) | Cod sursa (job #3283848)
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,s,nr;
int v[1025];
unordered_map <int,int>m;
int main()
{
f>>n>>s;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
nr+=m[s-(v[i]+v[j])];
for(int j=1;j<i;j++)
m[v[i]+v[j]]++;
}
g<<nr;
}