Pagini recente » Cod sursa (job #451000) | Cod sursa (job #2507273) | Cod sursa (job #2755198) | Cod sursa (job #3264347) | Cod sursa (job #1218407)
#include<fstream>
#include<vector>
using namespace std;
ifstream cin("oite.in");
ofstream cout("oite.out");
const int P = 66013;
long long n,l,i,j,a[1050],res=0;
vector<pair<long, pair<int,int> > > v[P];
int main()
{
cin>>n>>l;
for (i=1;i<=n;i++) cin>>a[i];
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
v[(a[i]+a[j])%P].push_back(make_pair((a[i]+a[j]),make_pair(i, j)));
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++) {
int x = (l - a[i] - a[j]), y=x % P;
for (int k=0;k<v[y].size();k++)
if (v[y][k].first==x && j<v[y][k].second.first)
++res;
}
cout<<res;
return 0;
}