Pagini recente » Cod sursa (job #1351035) | Cod sursa (job #837858) | Cod sursa (job #2719679) | Cod sursa (job #1820330) | Cod sursa (job #1190556)
#include <fstream>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,s,i,j,k,l,m,o,a[101];
int main()
{
fin>>n>>s;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
for(l=1;l<=n;l++)
for(m=1;m<=n;m++)
for(o=1;o<=n;o++)
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[o]==s)
{
fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<a[l]<<" "<<a[m]<<" "<<a[o];
return 0;
}
fout<<"-1";
}