while (!map[max])
max--;
- printf("Found subset with %d blocks:\n", max);
+ printf("Found subset with %d blocks of %d (%.2f%%):\n", max, m, 100.*max/m);
+ int free = m-max;
while (max)
{
int f = map[max]-2;
printf("%7d\t%s\n", files[f].blocks, files[f].name);
max -= files[f].blocks;
}
+ printf("%7d\t*FREE*\n", free);
return 0;
}