Pagini recente » Cod sursa (job #1864655) | Cod sursa (job #2363782)
#include <fstream>
#include <map>
#define MAXN 100
using namespace std;
ifstream cin( "loto.in" );
ofstream cout( "loto.out" );
struct Bilet
{
int nr1, nr2, nr3;
};
map<int,Bilet> b;
int v[MAXN+5];
int main()
{
int n, m;
cin>>n>>m;
for( int i=1;i<=n;i++ )
cin>>v[i];
int ans=0;
for( int i=1;i<=n && !ans;i++ )
for( int j=i;j<=n && !ans;j++ )
for( int k=j;k<=n && !ans;k++ )
{
int sum=v[i]+v[j]+v[k];
b[sum]={i,j,k};
if( b.find(m-sum)!=b.end() )
{
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<b[m-sum].nr1<<" "<<b[m-sum].nr2<<" "<<b[m-sum].nr3;
ans=1;
}
}
if( !ans )
cout<<"-1";
return 0;
}