Pagini recente » Cod sursa (job #3037762) | Diferente pentru problema/arborex intre reviziile 5 si 8 | Cod sursa (job #3187222) | Cod sursa (job #1500505) | Cod sursa (job #3283824)
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,s,nr;
int v[1025];
int main()
{
f>>n>>s;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+1+n);
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
for(int k=j+1;k<=n;k++)
for(int l=k+1;l<=n;l++)
if(v[i]+v[j]+v[k]+v[l]==s)
nr++;
cout<<nr;
}