Pagini recente » Cod sursa (job #997089) | Cod sursa (job #1691746) | Cod sursa (job #1091853) | Cod sursa (job #1772448) | Cod sursa (job #864028)
Cod sursa(job #864028)
# include <stdio.h>
int main() {
int n, i, j, k, l, m, p;
int t = 0;
long int s;
int v[100];
FILE *f, *g;
f = fopen("loto.in", "r");
g = fopen("loto.out", "w");
fscanf(f, "%d %ld", &n, &s);
for (i = 0; i < n; i++)
fscanf(f, "%d", &v[i]);
for (i = n - 1; i >= 0; i--)
// for (j = n - 1; j >= 0; j--)
for (k = n - 1; k >= 0; k--)
for (l = n - 1; l >= 0; l--)
//for (m = n - 1; m >= 0; m--)
for (p = n - 1; p >= 0; p--)
if (2*v[i] + v[k] + v[l] + 2*v[p] == s) {
fprintf(g, "%d %d %d %d %d %d\n", v[p], v[p], v[l], v[k], v[i], v[i]);
exit(0);
}
fprintf(g, "-1");
return 0;
}