Pagini recente » Cod sursa (job #1612305) | Cod sursa (job #2345426) | Cod sursa (job #927597) | Cod sursa (job #2894195) | Cod sursa (job #1530768)
#include<cstdio>
using namespace std;
int MOD,v[1025],hsh[666014],n,l,s;
long long posib;
int main(){
freopen("oite.in","r",stdin);
freopen("oite.out","w",stdout);
scanf("%d%d",&n,&l);
MOD=666013;
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
posib=0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
s=l-v[i]-v[j];
if(s>=0){
if(hsh[s]!=0)
posib+=hsh[s];
}
}
for(int j=1;j<i;j++){//perechea v[i], v[j]
s=(v[i]+v[j])%MOD;
hsh[s]++;
}
}
printf("%lld",posib);
return 0;
}