Pagini recente » Cod sursa (job #1560558) | Cod sursa (job #2929680) | Cod sursa (job #3209318) | Cod sursa (job #712705) | Cod sursa (job #974765)
Cod sursa(job #974765)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("oite.in");
ofstream fout ("oite.out");
const int Nmax = 1030;
const int Mod = 10009;
int N;
int V[Nmax];
int L;
int Solution;
vector <int> H[Mod];
void Read()
{
fin >> N >> L;
for(int i = 1; i <= N; ++i)
fin >> V[i];
}
void Solve()
{
for(int i = 1; i <= N; ++i)
{
for(int j = i + 1; j <= N; ++j)
{
int Sum = V[i] + V[j];
if(Sum >= L) continue;
int R = (L - Sum) % Mod;
for(unsigned i = 0 ; i < H[R].size(); ++i)
if(H[R][i] == L - Sum) Solution++;
}
for(int j = 1; j < i; ++j)
H[(V[i] + V[j]) % Mod].push_back(V[i] + V[j]);
}
}
void Print()
{
fout << Solution << '\n';
}
int main()
{
Read ();
Solve ();
Print ();
return 0;
}