Pagini recente » Cod sursa (job #2069940) | Cod sursa (job #482764) | Cod sursa (job #1381650) | Cod sursa (job #2240156) | Cod sursa (job #1550132)
#include <fstream>
#include <map>
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,x,y,s2,s3;
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];
s2=m-s;
x=M[s2].first;
y=M[s2].second;
if(x)
{
s3=s2-x-y;
out<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<x<<" "<<y<<" "<<s3<<'\n';
return 0;
}
}
}
}
out<<"-1"<<'\n';
return 0;
}