Pagini recente » Cod sursa (job #2317964) | Cod sursa (job #1919044) | Cod sursa (job #2478754) | Cod sursa (job #2031926) | Cod sursa (job #1109195)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n, s;
int v[101];
ifstream f("loto.in");
ofstream g("loto.out");
int main(){
f>>n>>s;
for(int i=0;i<n;i++)
f>>v[i];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int k=0;k<n;k++)
for(int l=0;l<n;l++)
for(int m=0;m<n;m++)
for(int o=0;o<n;o++)
if(v[i]+v[j]+v[k]+v[l]+v[m]+v[0]==s)
{g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[o];return 0;}
g<<"-1";
return 0;
}