Pagini recente » Cod sursa (job #296694) | Cod sursa (job #217793) | Cod sursa (job #3236317) | Cod sursa (job #3263704) | Cod sursa (job #2973904)
#include <fstream>
#include <vector>
#define mod 1000017
using namespace std;
ifstream fin ("oite.in");
ofstream fout ("oite.out");
int n,s,i,j,m,ok,su,k,rez,v[1026];
vector < pair <int,int> > x[mod];
int main()
{
fin>>n>>s;
for (i=1; i<=n; i++)
fin>>v[i];
for (i=1; i<=n; i++)
{
for (j=i+1; j<=n; j++)
{
su=s-v[i]-v[j];
if (s<0)
continue;
m=su%mod;
for (k=0; k<x[m].size (); k++)
{
if (x[m][k].first==su)
{
rez+=x[m][k].second;
break;
}
}
}
for (j=1; j<i; j++)
{
su=v[i]+v[j];
if (su>s)
continue;
m=su%mod;
ok=1;
for (k=0; k<x[m].size (); k++)
{
if (x[m][k].first==su)
{
x[m][k].second++;
ok=0;
break;
}
}
if (ok==1)
x[m].push_back (make_pair(su,1));
}
}
fout<<rez<<"\n";
return 0;
}