Pagini recente » Cod sursa (job #1210317) | Cod sursa (job #1239444) | Cod sursa (job #1718206) | Cod sursa (job #1829931) | Cod sursa (job #1764742)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,s;
unordered_map<int,int> a;
int arr[1025];
int arr1[1100000];
int nr;
int main()
{
int x;
f>> n >> s;
for(int i=1;i<=n;i++)
{
f>> x;
arr[i]=x;
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++)
if(s-arr[i]-arr[j]>=0){
nr+=a[s-arr[i]-arr[j]];
}
for(int k=0;k<i;k++)
a[arr[i]+arr[k]]++;
}
g << nr;
return 0;
}