Pagini recente » Cod sursa (job #1347185) | Cod sursa (job #31372) | Cod sursa (job #135124) | Cod sursa (job #1700973) | Cod sursa (job #342684)
Cod sursa(job #342684)
#include <iostream.h>
#include <fstream.h>
long long N,S,i,j,k,l,p,o,v[100];
int main()
{
ifstream f("loto.in");
ofstream g("loto.out");
f>>N>>S;
for (i=0;i<N;i++)
f>>v[i];
f.close();
for (i=0;i<N;++i)
for (j=0;j<N;++j)
for (k=0;k<N;++k)
for (l=0;l<N;++l)
for (p=0;p<N;++p)
for (o=0;o<N;++o)
if (v[i]+v[j]+v[k]+v[l]+v[p]+v[o]==S)
{
g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[p]<<" "<<v[o]<<"\n";
return 0;
}
g.close();
return 0;
}