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