FZU 1150 Peter's smokes


Peter's smokes
Time Limit:1s
Memory limit:32M
Accepted Submit:496
Total Submit:1090
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 is a sequence of lines. Each line contains two integer numbers giving the values of n and k. 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
Output for the sample input
5
14
124
Original: Albert 2001
 
문제 풀기:
어떻게 해야 가장 간단한 코드인지 봐라, 간단한 문제를 복잡하게 하지 마라.
#include using namespace std; int main() { int n,k; int sum; while(cin>>n>>k) { sum=n; while(n>=k) { sum+=n/k; n=n/k+n%k; } cout<

좋은 웹페이지 즐겨찾기