Pagini recente » Cod sursa (job #2892601) | Cod sursa (job #2795419) | Cod sursa (job #2210407) | Cod sursa (job #1317230) | Cod sursa (job #1846657)
#include <iostream>
#include <cstdio>
#include <string>
#include <fstream>
#include <algorithm>
using namespace std;
int v[101],suma[300000000],pos[100],lungime=0;
string triplet[100000];
int comp (int st, int dr)
{
return suma[st]<suma[dr];
}
int main()
{
ifstream intrare("loto.in");
ofstream iesire ("loto.out");
int i,j,k,n,s,numtr=1,numsum=1;
intrare>>n>>s;
for (i=1; i<=n; ++i)
{
intrare>>v[i];
}
for (i=0; i<=n; ++i)
{
pos[i]=i;
}
for (i=0; i<=n; ++i)
{
triplet[i]="0";
}
sort(v,v+n+1);
for (i=1; i<=n; ++i)
{
for (j=i; j<=n; ++j)
{
for (k=j; k<=n; ++k)
{
suma[numsum]=v[i]+v[j]+v[k];
numsum++;
string a,b,c;
a=48+v[i];
b=48+v[j];
c=48+v[k];
triplet[numtr]=a+" "+b+" "+c+" ";
numtr++;
lungime++;
}
}
}
for (i=1; i<=lungime-1; ++i)
{
for (j=i+1; j<=lungime; ++j)
{
if (s-suma[i]==suma[j])
{
iesire<<triplet[i]<<triplet[j];
return 0;
}
}
}
iesire<<"-1";
}