Pagini recente » Cod sursa (job #464762) | Cod sursa (job #1859308) | Cod sursa (job #375111) | Cod sursa (job #369190) | Cod sursa (job #36488)
Cod sursa(job #36488)
#include<stdio.h>
long long n,m,a[1025],i,j,k,l,nr;
int MAX(int x,int y)
{return x>y?x:y;}
int main()
{freopen("oite.in","r",stdin);
freopen("oite.out","w",stdout);
scanf("%lld %lld",&n,&m);
if(m>200000000) return 0;
for(i=1;i<=n;i++)
{scanf("%lld",&a[i]);
for(j=i-1;j>=0;j--)
for(k=j-1;k>=0;k--)
for(l=k-1;l>=0;l--)
if(a[i]+a[j]+a[k]+a[l]==m) nr++;}
printf("%lld",nr);
fclose(stdout);
return 0;}