This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
int cmpfunc (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int find_subset (int l, int u, int w[], int n, int result[])
{
qsort(w, n, sizeof(int), cmpfunc);
int i = 0, j = 0;
long v = 0;
do {
if (v < l && j<n) {
v += w[j++];
} else if (v > u && i<n) {
v -= w[i++];
} else {
break;
}
} while (1);
if (v>=l && v>=u) {
for (int k=i; k<j; ++k)
result[k-i] = w[k];
return j-i;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |