Pagini recente » Cod sursa (job #2830635) | Cod sursa (job #906157) | Cod sursa (job #2756654) | Cod sursa (job #244097) | Cod sursa (job #1142208)
#include<fstream>
using namespace std;
int main()
{
int v[101],s,i,n,k,m,l,p,j;
ifstream in("loto.in");
ofstream out("loto.out");
in>>n>>s;
for(i = 1 ; i <= n ; i++)
in>>v[i];
for(i = 1 ; i <= n ; i++ )
for(k = 1 ; k<= n ; k++ )
for(m = 1 ; m<= n ; m++)
for(l = 1; l<=n ; l++)
for(p = 1 ; p<=n ; p++)
for(j = 1 ; j<=n ; j++)
{
if((v[i] + v[k] + v[m]+v[l]+v[p]+v[j]==s))
{
out<<i<<" "<<k<<" "<<m<<" "<<l<<" "<<p<<" "<<j;
out.close();
return 0;
}
}
out<<-1;
out.close();
return 0;
}