Cod sursa(job #36490)
| Utilizator | Data | 23 martie 2007 17:01:50 | |
|---|---|---|---|
| Problema | Oite | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#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(i=1;i<=n-3;i++)
for(j=i+1;j<=n-2;j++)
for(k=j+1;k<=n-1;k++)
for(l=k+1;l<=n;l++)
if(a[i]+a[j]+a[k]+a[l]==m) nr++;
printf("%lld",nr);
fclose(stdout);
return 0;}
