Pagini recente » Cod sursa (job #3291492) | Cod sursa (job #1603780) | Cod sursa (job #3200853) | Cod sursa (job #1394129) | Cod sursa (job #1666549)
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
long long s,v[3];
int n;
void citire(){
f>>n>>s;
for (int i=1;i<=n;i++)
f>>v[i];
f.close();
}
void solve(){
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
for (int k=1;k<=n;k++)
for (int l=1;l<=n;l++)
for (int m=1;m<=n;m++)
for (int o=1;o<=n;o++)
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];
g.close();
return;}
}
int main(){
citire();
solve();
return 0;
}