Pagini recente » Cod sursa (job #2123049) | Cod sursa (job #51372) | Cod sursa (job #1558990) | Cod sursa (job #1595355) | Cod sursa (job #1185457)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int main()
{
int n, v[101], i, t, k=0, s, j;
f>>n>>s;
for (i=1;i<=n;i++)
f>>v[i];
/*for (i=1;i<=n;i++) {
for (j=i+1;j<=n;j++)
if (v[i]>v[j]) {
t=v[i];
v[i]=v[j];
v[j]=t;
}
}*/
int i2, i3, i4, i5, i6, ok=1;
for (i=1;i<=n;i++)
for (i2=i;i2<=n;i2++)
for (i3=i2;i3<=n;i3++)
for (i4=i3;i4<=n;i4++)
for (i5=i4;i5<=n;i5++)
for (i6=i5;i6<=n;i6++)
if (v[i] + v[i2] + v[i3] + v[i4] + v[i5] + v[i6] == s) {
g<<v[i]<<"\t"<<v[i2]<<"\t"<<v[i3]<<"\t"<<v[i4]<<"\t"<<v[i5]<<"\t"<<v[i6];
ok=0;
i=i2=i3=i4=i5=n+1;
}
if (ok==1)
g<<-1;
return 0;
}
//3 36