Reads needed for a response

Challenge

A client reading at most chunk bytes per recv needs several calls to read a whole response. Compute how many recv calls are required.

Task

Implement int reads_needed(int total, int chunk) that returns the number of recv calls (a ceiling division of total by chunk). Return 0 if chunk <= 0.

Input

• total: total bytes to read.
• chunk: maximum bytes read per call.

Output

Returns ceil(total / chunk), or 0 when chunk <= 0.

Example

reads_needed(1000, 256)   ->   4
reads_needed(512, 256)    ->   2
reads_needed(100, 0)      ->   0

Edge cases

• chunk <= 0: return 0 (avoid dividing by zero).

Input format

Two integers: total bytes and chunk size per read.

Output format

ceil(total / chunk), or 0 if chunk <= 0.

Constraints

Use ceiling division; guard chunk <= 0 by returning 0.

Starter code

int reads_needed(int total, int chunk) {
    /* TODO */
    return 0;
}