Pagini recente » Cod sursa (job #2563479) | Cod sursa (job #1242074) | Cod sursa (job #1288092) | Cod sursa (job #377089) | Cod sursa (job #2142671)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,s,i,j,l,t,p,v,a[1000],d;
int main()
{
f>>n>>s;
for(i=1;i<=n;i++)f>>a[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(l=1;l<=n;l++)
{
for(t=1;t<=n;t++)
{
for(p=1;p<=n;p++)
{
for(v=1;v<=n;v++)
{
if(a[i]+a[j]+a[l]+a[t]+a[p]+a[v]==s)
{
d=1;
g<<i<<" "<<j<<" "<<l<<" "<<t<<" "<<p<<" "<<v;
i=n+1;
j=n+1;
l=n+1;
t=n+1;
p=n+1;
v=n+1;
}
}
}
}
}
}
}
if(d==0)g<<-1;
return 0;
}