Find all multiples of a number in given range in reverse order
Multiplication is not a very cheap operation.
Subtraction is much cheaper.
It will be a better and cleaner algorithm to start from the highest multiple,
and then keep subtracting until reaching 0:

int truncatedCount = limit / divisor;
int highestMultiple = truncatedCount * divisor;

for (int multiple = highestMultiple; multiple &gt; 0; multiple -= divisor) {
    printf("%d ", multiple);
}


The improvements:


multiplication replaced by subtractions
more meaningful variable names (instead of i, for example)
more conventional spacing (around operators and around (...) and { ... }