F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_27456705_25296\Main.java:3: 错误: 解析时已到达文件结尾
  public static void main(String args[]){        Scanner sc = new Scanner(System.in);        while(sc.hasNext()){            int l = sc.nextInt();            int n = sc.nextInt();            int c = sc.nextInt();            int t = sc.nextInt();            int vr = sc.nextInt();            int vt1 = sc.nextInt();            int vt2 = sc.nextInt();            int[] p = new int[n+2];            for (int i = 1; i < p.length-1; i++) {                p[i] = sc.nextInt();            }            p[0]=0;//第一个点为原点            p[p.length-1]=l;//最后一个点为终点            double tr = 1.0*l/vr;  //兔子跑到终点的时间                     double[] dp = new double[n+2];            for (int i = 1; i < dp.length; i++) {                dp[i]=10000000000000.0;//乌龟跑到没一个点的最小时间            }            dp[0]=0; // 到达第一个点的时间            for (int i = 1; i < p.length; i++) {                for (int j = 0; j < i; j++) {                    double time;                    if (p[i]-p[j]<=c) {//从j加了油后可以全程加速到达i                        time = 1.0*(p[i]-p[j])/vt1+t;                    }else {//加速一段,骑一段                         time = 1.0*c/vt1+1.0*(p[i]-p[j]-c)/vt2+t;                    }                    if (j==0) {//起点车是满电,不该算加油时间                        time -= t;                    }                    time = dp[j]+time;//从0到达第j个加油站所花的最小时间+第j到第i所花的时间;                    dp[i] = time<dp[i]?time:dp[i];//从第1个加油站到第i个加油站的所有可能中取最小时间                }            }            if (dp[n+1]<tr) {                System.out.println("What a pity rabbit!");            }else {                System.out.println("Good job,rabbit!");            }        }    }}
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      ^
0_0_27456705_25296\Main.java:3: 错误: 解析时已到达文件结尾
  public static void main(String args[]){        Scanner sc = new Scanner(System.in);        while(sc.hasNext()){            int l = sc.nextInt();            int n = sc.nextInt();            int c = sc.nextInt();            int t = sc.nextInt();            int vr = sc.nextInt();            int vt1 = sc.nextInt();            int vt2 = sc.nextInt();            int[] p = new int[n+2];            for (int i = 1; i < p.length-1; i++) {                p[i] = sc.nextInt();            }            p[0]=0;//第一个点为原点            p[p.length-1]=l;//最后一个点为终点            double tr = 1.0*l/vr;  //兔子跑到终点的时间                     double[] dp = new double[n+2];            for (int i = 1; i < dp.length; i++) {                dp[i]=10000000000000.0;//乌龟跑到没一个点的最小时间            }            dp[0]=0; // 到达第一个点的时间            for (int i = 1; i < p.length; i++) {                for (int j = 0; j < i; j++) {                    double time;                    if (p[i]-p[j]<=c) {//从j加了油后可以全程加速到达i                        time = 1.0*(p[i]-p[j])/vt1+t;                    }else {//加速一段,骑一段                         time = 1.0*c/vt1+1.0*(p[i]-p[j]-c)/vt2+t;                    }                    if (j==0) {//起点车是满电,不该算加油时间                        time -= t;                    }                    time = dp[j]+time;//从0到达第j个加油站所花的最小时间+第j到第i所花的时间;                    dp[i] = time<dp[i]?time:dp[i];//从第1个加油站到第i个加油站的所有可能中取最小时间                }            }            if (dp[n+1]<tr) {                System.out.println("What a pity rabbit!");            }else {                System.out.println("Good job,rabbit!");            }        }    }}
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    ^
2 个错误


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-09-29 15:34:08, Gzip enabled