水题:
#include<stdio.h>
#include <iostream>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<list>
#include<vector>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
int main()
{
int l,i,n,t,T,a[9];
int count=1;
while(scanf("%d",&l),l)
{
T=0;
scanf("%d%d",&n,&t);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
T=(int)((l*1.0)/a[0]+0.5)+(n-1)*t;
printf("Case %d: %d\n",count++,T);
}
return 0;
}