Pagini recente » Cod sursa (job #1724032) | Cod sursa (job #1746581) | Cod sursa (job #3160464) | Cod sursa (job #57321) | Cod sursa (job #36483)
Cod sursa(job #36483)
#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("%d %d",&n,&m);
if(m>200000000) return 0;
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
for(k=j+1;k<=n;k++)
for(l=k+1;l<=n;l++)
if(a[i]+a[j]+a[k]+a[l]==m) nr++;
printf("%d",nr);
fclose(stdout);
return 0;}