Pagini recente » Cod sursa (job #2100212) | Cod sursa (job #2000061) | Cod sursa (job #2354416) | Cod sursa (job #2501935) | Cod sursa (job #1983431)
#include<cstdio>
#include<vector>
using namespace std;
const int mod=666013;
int v[1100];
vector<int>g[mod];
inline bool find_num(int nr)
{
vector<int>::iterator it;
int x=nr%mod;
for(it=g[x].begin();it!=g[x].end();++it)
if(*it==nr)
return 1;
return 0;
}
inline void add_num(int nr)
{
int x=nr%mod;
g[x].push_back(nr);
}
int main()
{
freopen("oite.in","r",stdin);
freopen("oite.out","w",stdout);
int n,i,j,s,sol=0,normsum;
scanf("%d%d",&n,&s);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
normsum=s-v[i]-v[j];
if(normsum>=0&&find_num(normsum))
sol++;
}
for(j=1;j<i;j++)
add_num(v[i]+v[j]);
}
printf("%d",sol);
}