Pagini recente » cluj.love.icrisop | Cod sursa (job #2028302) | Cod sursa (job #1489776) | Cod sursa (job #358189) | Cod sursa (job #1550127)
#include <bits/stdc++.h>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
map <int,pair<int,int > > M;
int a[102];
int main()
{int n,s,i,j,k,m;
in>>n>>m;
for(i=1;i<=n;i++)
in>>a[i];
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
for(k=j;k<=n;k++)
{
s=a[i]+a[j]+a[k];
M[s]=make_pair(a[i],a[j]);
}
}
}
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
for(k=j;k<=n;k++)
{
s=a[i]+a[j]+a[k];
int s2=m-s;
if(M[s2].first)
{
int s3=s2-M[s2].first-M[s2].second;
out<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<M[s2].first<<" "<<M[s2].second<<" "<<s3<<'\n';
return 0;
}
}
}
}
out<<"-1"<<'\n';
return 0;
}