Pagini recente » Cod sursa (job #333638) | Cod sursa (job #2079895) | Cod sursa (job #3041021) | Cod sursa (job #10195) | Cod sursa (job #1265141)
#include<fstream>
#include<vector>
using namespace std;
#define NMAX 666013
ifstream fin("oite.in");
ofstream fout("oite.out");
vector < pair <int,int> > v[NMAX];
int n,l,sol,a[1028];
bool query(int x)
{
int i,m=x%NMAX;
for (i=0;i<v[m].size();++i)
if (v[m][i].first==x)
return true;
return false;
}
void adauga(int x)
{
int i,m=x%NMAX;
for (i=0;i<v[m].size();++i)
if (v[m][i].first==x)
{
++v[m][i].second;
return ;
}
v[m].push_back(make_pair(x,1));
}
int main()
{
int i,j;
fin>>n>>l;
for (i=1;i<=n;++i)
fin>>a[i];
for (i=1;i<n;++i)
{
for (j=i+1;j<=n;++j)
if (query(l-a[i]-a[j]))
++sol;
for (j=1;j<i;++j)
adauga(a[i]+a[j]);
}
fout<<sol<<"\n";
return 0;
}