UVA 11689 - Soda Surpler UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int n,e,f,c,a,b,d,i; while (scanf("%d",&n)==1) { for (i=0;i=c) { a=d/c; b=b+a; d=a+(d%c); } printf("%d\n",b); } } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11689/11689.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