Pagini recente » Cod sursa (job #1400084) | Cod sursa (job #1074175) | Cod sursa (job #650640) | Cod sursa (job #1112231) | Cod sursa (job #1376612)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int a=0,b=0,c=0,d=0,e=0,f=0,n,v[100],i,s,ok=0;
ifstream z("loto.in");
ofstream g("loto.out");
z>>n>>s;
for(i=0;i<n;i++)
z>>v[i];
while(ok==0&&f<n){
e=0;
while(ok==0&&e<n){
d=0;
while(ok==0&&d<n){
c=0;
while(ok==0&&c<n){
b=0;
while(ok==0&&b<n){
a=0;
while(ok==0&&a<n){
if(v[a]+v[b]+v[c]+v[d]+v[e]+v[f]==s)
ok=1;
a++;
}
b++;
}
c++;
}
d++;
}
e++;
}
f++;
}
if(ok==1)
g<<v[a-1]<<' '<<v[b-1]<<' '<<v[c-1]<<' '<<v[d-1]<<' '<<v[e-1]<<' '<<v[f-1];
else
g<<-1;
}