UVA 10346 - Peter's Smokes UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int a,n,k; while(scanf("%d %d",&n,&k)==2 && k>1) { a=n; while(n>=k) { a=a+(n/k); n=(n/k)+(n%k); } printf("%d\n",a); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10346/10346.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read