l=list(map(int,input().rstrip().split()))
main=l[0]
n=l[1]
sum=0
while main!=0:
main-=1
sum+=1
if sum%n==0:
main+=1
print(sum)#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll l, b, nl = 0, time = 0, n;
cin>>l>>b;
time += l;
nl += l;
while (true) {
if (nl/b > 0) {
time += nl/b;
n = nl;
nl -= (nl/b)*b;
nl += n/b;
}
else break;
}
cout<<time;
}129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |