Pagini recente » Cod sursa (job #1565383) | Cod sursa (job #1790009) | da_i_pe_suflet | Cod sursa (job #1550026) | Cod sursa (job #1089170)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
#define cout g
int n,s;
int a[101];
int q,nr,p,i;
void scrie(int val,int nr)
{
for(;nr;--nr) cout<<val<<' ';
}
int main()
{
f>>n>>s;
for(i=0;i<n;++i) f>>a[i];
sort(a,a+n);
q=s/6;
nr=0;
p=lower_bound(a,a+n,q)-a;
if (6*a[p]==s) scrie(a[p],6);
//for(i=0;i<n;++i) cout<<a[i]<<' ';
//cout<<'\n';
return 0;
}