Pagini recente » Cod sursa (job #1786939) | Cod sursa (job #2655161) | Cod sursa (job #1606644) | Cod sursa (job #1309186) | Cod sursa (job #2434035)
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#define null NULL
#define in "loto.in"
#define out "loto.out"
typedef struct partial
{
int added;
int last_index;
}Sums;
int compare(const void *a, const void *b)
{
return (*((int *)a)) - (*((int *)b));
}
int main(int argc, char const *argv[])
{
FILE *read = (FILE *) fopen(in, "r");
FILE *write = (FILE *) fopen(out, "w");
int N, S;
fscanf(read, "%d%d", &N, &S);
int *array = (int *) calloc(N, sizeof(int));
for (int i = 0; i < N; i++)
fscanf(read, "%d", &array[i]);
qsort(array, N, sizeof(int), compare);
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 n = 0; n < N; n++)
if (array[i] + array[j] + array[k] + array[l] + array[m] + array[n] == S)
{
fprintf(write, "%d %d %d %d %d %d\n", array[i], array[j], array[k]
,array[l], array[m], array[n]);
goto done;
}
fprintf(write, "-1\n");
done:
free(array);
fclose(read);
fclose(write);
return 0;
}