Pagini recente » Cod sursa (job #1367869) | Cod sursa (job #425099) | Istoria paginii runda/bidonel/clasament | Cod sursa (job #339921) | Cod sursa (job #1228841)
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <ctime>
#include <cassert>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <utility>
#include <queue>
#include <deque>
#include <list>
#include <iterator>
#include <limits>
#include <numeric>
#include <functional>
using namespace std;
#define nl "\n"
typedef long long ll;
typedef unsigned long ulong;
typedef unsigned int uint;
typedef unsigned char uchar;
const double PI = acos(-1.0);
ifstream fin("input.txt");
ofstream fout("output.txt");
int arr[102],n,s;
void foo()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
for(int h=1;h<=n;h++)
for(int b=1;b<=n;b++)
for(int z=1;z<=n;z++)
if(arr[i]+arr[j]+arr[k]+arr[h]+arr[b]+arr[z]==s)
{
fout<<arr[i]<<" "<<arr[j]<<" "<<arr[k]<<" "<<arr[h]<<" "<<arr[b]<<" "<<arr[z]<<nl;
return;
}
fout<<-1<<nl;
}
int main()
{
fin>>n>>s;
for(int i=1;i<=n;i++)
fin>>arr[i];
foo();
return 0;
}