UVA 11150 - Cola UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int a,n; while(scanf("%d",&n)==1) { a=n; while(n>=3) { a=a+(n/3); n=(n/3)+(n%3); } if(n==2) { a++; } printf("%d\n",a); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11150/11150.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