Pagini recente » Cod sursa (job #2565464) | Cod sursa (job #1715129) | Cod sursa (job #2955147) | Cod sursa (job #881591) | Cod sursa (job #1142197)
#include<fstream>
using namespace std;
int main()
{
long long v[100],s,i;
int n;
ifstream in("loto.in");
ofstream out("loto.out");
in>>n>>s;
for(i = 1 ; i <= n ; i++)
in>>v[i];
bool b = false;
for(i = 1 ; i <= n ; i++ )
for(int k = 1 ; k<= n ; k++ )
for(int m = 1 ; m<= n ; m++)
for(int l = 1; l<=n ; l++)
for(int p = 1 ; p<=n ; p++)
for(int j = 1 ; j<=n ; j++)
{
if((v[i] + v[k] + v[m]+v[l]+v[p]+v[j]==s) && !b)
{
b = true;
out<<i<<" "<<k<<" "<<m<<" "<<l<<" "<<p<<" "<<j;
}
}
if(!b) out<<-1;
out.close();
in.close();
return 0;
}