Pagini recente » Cod sursa (job #2018939) | Cod sursa (job #1567235) | Cod sursa (job #2017237) | Cod sursa (job #1009472) | Cod sursa (job #1410176)
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream fin ("oite.in");
ofstream fout ("oite.out");
int N, L, sol, V[1100];
vector < int > 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 = 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]) {
sol++;
}
}
}
for (int j = i - 1; j >= 1; j--)
{
int sum = V[i] + V[j];
int poz = sum % MOD;
H[poz].push_back(sum);
}
}
fout << sol << '\n';
fout.close();
return 0;
}