Pagini recente » Cod sursa (job #3244456) | Cod sursa (job #2174685) | Cod sursa (job #1121787) | Cod sursa (job #239424) | Cod sursa (job #1500935)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
int n,l,i,a[1025],j,nr,s;
int main()
{
fin>>n>>l;
for(i=1; i<=n; i++)
fin>>a[i];
sort(a+1,a+n+1);
int i1,i2,i3,i4;
for(i1=1; i1<=n; i1++)
for(i2=i1+1; i2<=n; i2++)
for(i3=i2+1; i3<=n; i3++)
for(i4=i3+1; i4<=n; i4++)
{
s=a[i1]+a[i2]+a[i3]+a[i4];
if(s==l) nr++;
}
fout<<nr;
return 0;
}