Pagini recente » Cod sursa (job #1362531) | Cod sursa (job #1743214) | Cod sursa (job #1026009) | Cod sursa (job #790543) | Cod sursa (job #1500620)
#include<fstream>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,s,a[1025],i,j,x[10],k,con,sm;
int valid(int k)
{
for(int iii=1;iii<k;iii++)
if(x[iii]==x[k])
return 0;
return 1;
}
int main()
{
f>>n>>s;
for(i=1;i<=n;i++)
f>>a[i];
i=1;
do
{
do
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else if(valid(i)==1)
i++;
}while(i>0&&i<=4);
if(i>4)
{
sm=0;
for(j=1;j<=4;j++)
sm+=a[x[j]];
if(sm==s)
con++;
}
i--;
}while(i>0);
g<<con/24;
return 0;
}