Pagini recente » Cod sursa (job #687367) | Cod sursa (job #791213) | Cod sursa (job #76003) | Cod sursa (job #1368133) | Cod sursa (job #766903)
Cod sursa(job #766903)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int a[101],n,s;
void Solve()
{int i,j,k,l,m,q;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
for(m=1;m<=n;m++)
for(q=1;q<=n;q++)
for(l=1;l<=n;l++)
if(a[i]+a[j]+a[l]+a[k]+a[m]+a[q]==s)
{g<<a[i]<<" ";
g<<a[j]<<" ";
g<<a[k]<<" ";
g<<a[m]<<" ";
g<<a[q]<<" ";
g<<a[l]<<" ";
return;
}
}
int main()
{f>>n>>s;
int i;
for(i=1;i<=n;i++) f>>a[i];
Solve();
return 0;
}