Pagini recente » Cod sursa (job #3193784) | Cod sursa (job #1532845) | Cod sursa (job #2432945) | Cod sursa (job #2687076) | Cod sursa (job #3193487)
#include <bits/stdc++.h>
#define MOD 999771
#define N_MAX 1000000
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
int resturi[N_MAX];
int oi[1030];
int n, l;
long long int rez = 0;
int main()
{
fin >> n >> l;
for (int i = 1; i <= n; i++)
fin >> oi[i];
sort(oi + 1, oi + n + 1);
for (int i = 2; i < n - 1; i++)
{
for (int j = 1; j <= i - 1; j++)
{
resturi[(oi[i] + oi[j]) % MOD]++;
}
for (int j = i + 2; j <= n; j++)
{
if ((l - oi[i + 1] - oi[j]) >= (oi[1] + oi[2]))
rez += resturi[(l - oi[i + 1] - oi[j])%MOD];
}
}
fout<<rez;
}