UVA 11597 - Spanning Subtree

Problem PDF

Solution:

#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