Pagini recente » Cod sursa (job #1624087) | Cod sursa (job #2107436) | Cod sursa (job #1465279) | Cod sursa (job #3206033) | Cod sursa (job #3130145)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
struct elem
{
int sum, i, j;
};
struct hash_
{
vector<elem> vec;
};
int n, s;
int v[1030];
hash_ h[945350];
int MOD = 945327;
long long ans = 0;
void ins(int val, int i, int j)
{
int x = val % MOD;
elem aux;
aux.sum = val;
aux.i = i;
aux.j = j;
h[x].vec.push_back(aux);
}
void sr(int val, int i, int j)
{
int x = val % MOD;
for(auto el: h[x].vec)
{
if(val == el.sum && i != el.i && i != el.j && j != el.i && j != el.j && j < el.i)
{
ans++;
//out<<i<<" "<<j<<" "<<el.i<<" "<<el.j<<'\n';
}
}
}
int main()
{
in>>n>>s;
for(int i = 1; i<=n; i++)
{
in>>v[i];
}
for(int i = 1; i<n; i++)
{
for(int j = i+1; j<=n; j++)
{
ins(v[i] + v[j], i, j);
}
}
for(int i = 1; i<=n-3; i++)
{
for(int j = i+1; j<=n-2; j++)
{
if(s-v[i]-v[j] >= 0)
{
sr(s-v[i]-v[j], i, j);
}
}
}
out<<ans;
return 0;
}