Pagini recente » Cod sursa (job #2062249) | Cod sursa (job #995722) | Cod sursa (job #532637) | Cod sursa (job #1102541) | Cod sursa (job #1410168)
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream fin ("oite.in");
ofstream fout ("oite.out");
typedef struct { int p1, p2, val; } art;
int N, L, sol, V[1100];
vector < art > H[MOD + 16];
int main()
{
fin >> N >> L;
for (int i = 1; i <= N; i++) {
fin >> V[i];
}
for (int i = 1; i < N; i++)
{
for (int j = i + 1; j <= N; j++)
{
int sum = V[i] + V[j];
int poz = sum % MOD;
H[poz].push_back( { i, j, sum } );
}
}
for (int i = 1; i < N; i++)
{
for (int j = i + 1; j <= N; j++)
{
int sum = L - (V[i] + V[j]);
if (sum < 0) continue;
int poz = sum % MOD;
for (int k = 0; k < H[poz].size(); k++)
{
if (sum == H[poz][k].val &&
H[poz][k].p1 != i &&
H[poz][k].p1 != j &&
H[poz][k].p2 != i &&
H[poz][k].p2 != j) {
sol++;
}
}
}
}
fout << sol / 6 << '\n';
fout.close();
return 0;
}