Pagini recente » Cod sursa (job #1260024) | Cod sursa (job #1689321) | Cod sursa (job #645832) | Cod sursa (job #751292) | Cod sursa (job #1074095)
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int *v,s,n;
int cautbin(int s)
{
int i=0, pas = 1 << 17;
while(pas!=0)
{
if(i+pas <=n && v[i+pas]<=s)
{
i+=pas;
}
pas/=2;
}
return i;
}
int main()
{
in >> n >> s;
v = (int *) malloc(sizeof(int)*(n+1));
for(int i=1;i<=n;i++)
in >> v[i];
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
for(int k=j;k<=n;k++)
for(int p=k;p<=n;p++)
for(int l=p;l<=n;l++)
for(int q=l;q<=n;q++)
if(v[i]+v[j]+v[k]+v[p]+v[l]+v[q] == s)
{
out << i << " " << j << " " << k << " " << p << " "<<l<<" "<<q<<endl;
return 0;
}
out << -1;
//---------
in.close();
out.close();
return 0;
}