Scribd
Upload
11 views1 page

Input

The document describes a problem where Peter has n cigarettes and can roll new cigarettes from k cigarette butts. Given values of n and k in input, the output should be the maximum number of cigarettes Peter can have. A sample input and output are provided as an example.

Uploaded by

yassine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

Input

The document describes a problem where Peter has n cigarettes and can roll new cigarettes from k cigarette butts. Given values of n and k in input, the output should be the maximum number of cigarettes Peter can have. A sample input and output are provided as an example.

Uploaded by

yassine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Peter has n cigarettes. He smokes them one by one keeping all the butts.

Out of k > 1 butts he can


roll a new cigarette.
How many cigarettes can Peter have?

Input
Input is a sequence of lines. Each line contains two integer numbers giving the values of n and k. The
input is terminated by end of file.

Output
For each line of input, output one integer number on a separate line giving the maximum number of
cigarettes that Peter can have.

Sample Input
4 3
10 3
100 5

Sample Output
5
14
124

You might also like