Pagini recente » Cod sursa (job #855672) | Cod sursa (job #38931) | Cod sursa (job #739148) | Cod sursa (job #1979753) | Cod sursa (job #1540678)
#include<fstream>
#include<vector>
#define M 666013
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
vector <long long> v[M];
long long c, l, nr, oi[1024];
int main()
{
in>>c>>l;
int i, j, k;
long long s=0,lv=0;
for(i=1; i<=c; i++)
in>>oi[i];
for(i=1; i<=c-1; i++)
{
for(j=i+1; j<=c; j++)
{
s=l-oi[i]-oi[j];
//lv=v[s%M].size();
if(s>=0)
for(k=0; k<v[s%M].size(); k++)
if(v[s%M][k]==s)
nr++;
}
for(j=1;j<i;j++)
{
//int sum=oi[i]+oi[j];
v[(oi[i]+oi[j])%M].push_back(oi[i]+oi[j]);
}
}
out<<nr;
return 0;
}