UVA 11597 - Spanning Subtree Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include int main() { int a,i=1; while(scanf("%d",&a)==1 && a>1) { printf("Case %d: %d\n",i,a/2); i++; } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11597/11597.cpp