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 le.
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
-----------------------------------------------------------------------
///Alamgir Hossain
///CSE,JUST
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
while(scanf("%d %d",&n,&k)!=EOF){
cout<<n+(n-1)/(k-1)<<endl;
}
return 0;
}
///CSE,JUST
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
while(scanf("%d %d",&n,&k)!=EOF){
cout<<n+(n-1)/(k-1)<<endl;
}
return 0;
}
This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.
ConversionConversion EmoticonEmoticon