Solution:
#include
#include
int main()
{
double u,v,s,t,a;
int te=1,n;
while(scanf("%d",&n)==1 && n!=0)
{
if(n==1)
{
scanf("%lf%lf%lf",&u,&v,&t);
s=(u+v)*t/2;
a=(v-u)/t;
printf("Case %d: %.3lf %.3lf\n",te++,s,a);
}
else if(n==2)
{
scanf("%lf%lf%lf",&u,&v,&a);
t=(v-u)/a;
s=(u+v)*t/2;
printf("Case %d: %.3lf %.3lf\n",te++,s,t);
}
else if(n==3)
{
scanf("%lf%lf%lf",&u,&a,&s);
v=sqrt(u*u+2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",te++,v,t);
}
else if(n==4)
{
scanf("%lf%lf%lf",&v,&a,&s);
u=sqrt(v*v-2*a*s);
t=(v-u)/a;
printf("Case %d: %.3lf %.3lf\n",te++,u,t);
}
}
return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11715/11715.cpp