Pagini recente » Cod sursa (job #2033734) | Cod sursa (job #2230268) | Cod sursa (job #3147269) | Istoria paginii preoni-2005/runda-2/clasament-11-12 | Cod sursa (job #877958)
Cod sursa(job #877958)
#include<fstream>
using namespace std;
long i,j,k,l,m,n,v[100],s,gi=1,o;
int main()
{
ifstream f("loto.in");
ofstream g("loto.out");
f>>n>>s;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
for(l=1;l<=n;l++)
for(m=1;m<=n;m++)
for(o=1;o<=n;o++)
if(gi)
if(v[i]+v[j]+v[k]+v[l]+v[m]+v[o]==s)
{g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[o];
gi=0; }
if(gi) g<<-1;
}