Pagini recente » Cod sursa (job #2762224) | Cod sursa (job #1508460) | Cod sursa (job #207388) | Cod sursa (job #2833399) | Cod sursa (job #36499)
Cod sursa(job #36499)
#include<stdio.h>
int n,a[1025],i,j,k,l,m,x,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-3;i++)
{x=a[i];
for(j=i+1;j<=n-2&&x<=m;j++)
{x=x+a[j];
for(k=j+1;k<=n-1&&x<=m;k++)
{x=x+a[k];
for(l=k+1;l<=n&&x<=m;l++)
if(x+a[l]==m) nr++;
x=x-a[k];}
x=x-a[j];}}
printf("%d",nr);
fclose(stdout);
return 0;}