Pagini recente » Cod sursa (job #2444706) | Cod sursa (job #3239580) | Cod sursa (job #2740926) | Cod sursa (job #949206) | Cod sursa (job #1909119)
#include <bits/stdc++.h>
using namespace std;
int n,s,t[1025],nr;
int main()
{
ifstream cin("oite.in");
ofstream cout("oite.out");
cin>>n>>s;
for (int i=1; i<=n; i++)
cin>>t[i];
sort(t+1,t+n+1);
for (int i=1; i<=n-3; i++)
for (int j=i+1; j<=n-2; j++)
for (int k=j+1; k<=n-1; k++)
for (int z=k+1; z<=n; z++)
{
if (t[i]+t[j]+t[k]+t[z]==s) nr++; else if (t[i]+t[j]+t[k]+t[z]>s) break;
}
cout<<nr;
}