1.26C

#include<stdio.h>
#include<algorithm>
using namespace std;
double l=0xfffff;
//double min(double a,double b)
//{
//       if(a<b)
//       return a;
//       else
//       return b;
//}
int main()
{
 int L;
 int n,c,t;
 int vr,v1,v2;
 int s[110]={0};
 while(~scanf("%d",&L))
 {
  scanf("%d %d %d %d %d %d",&n,&c,&t,&vr,&v1,&v2);
  int i,j,k,len;
        double time=0,DP[200]={0},time2=0;
  for(i=1;i<=n;i++)
  scanf("%d",&s[i]);
  s[0]=0,s[n+1]=L;
  for(i=1;i<=n+1;i++)
  {
                           DP[i]=l;
   for(j=0;j<i;j++)
   {
   len=s[i]-s[j];
   if(len>c)
   time=c*1.0/v1+(len-c)*1.0/v2;
   else
   time=len*1.0/v1;
   time+=DP[j];
   if(j>0)
   time+=t;
   DP[i]=min(DP[i],time);
         }
  }
  time2=L*1.0/vr;
  if(DP[n+1]>=time2)
  printf("Good job,rabbit!\n");
  else
  printf("What a pity rabbit!\n");
 }
 return 0;
}