Pagini recente » Cod sursa (job #2958581) | Cod sursa (job #265624) | Monitorul de evaluare | Cod sursa (job #2223039) | Cod sursa (job #1611382)
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("lote.out");
int n,s,v[50];
void citire()
{int i;
f>>n>>s;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
}
void solve()
{int i,j,k,l,m,x;
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(x=1;x<=n;x++)
if (v[i]+v[j]+v[k]+v[l]+v[m]+v[x]==s)
{g<<v[i]<<v[j]<<v[k]<<v[l]<<v[m]<<v[x];
g.close();
}
}
int main()
{
citire();
if((6-n)*n<=s)solve();
else g<<"-1";
}