Pagini recente » Cod sursa (job #1196537) | Cod sursa (job #1148288) | Cod sursa (job #2981134) | Cod sursa (job #969515) | Cod sursa (job #2929736)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
const int mod = 666013;
vector <int> h[mod];
int c, l, x;
int rez;
int lana[1025];
void update(int x)
{
int poz = x % mod;
h[poz].push_back(x);
}
void check(int x)
{
int poz = x % mod;
for(int i = 0; i < h[poz].size(); i++)
if(h[poz][i] == x)
rez++;
}
int main()
{
fin >> c >> l;
for(int i = 1; i <= c; i++)
{
fin >> x;
lana[i] = x;
}
for(int i = 2; i <= c; i++)
{
for(int j = i + 1; j <= c; j++)
{
int sum = lana[i] + lana[j];
check(l - sum);
}
for(int j = i - 1; j >= 1; j--)
update(lana[i] + lana[j]);
}
fout << rez;
return 0;
}