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_31972567_5946\Main.java:1: 错误: 解析时已到达文件结尾
import java.util.*; class Main{ static int t,l,n,c,vr,vt1,vt2; static double []d; static double time; public static void main(String args[]){ Scanner sc= new Scanner(System.in); while(sc.hasNext()) { l=sc.nextInt(); n=sc.nextInt(); c=sc.nextInt(); t=sc.nextInt(); vr=sc.nextInt(); vt1=sc.nextInt(); vt2=sc.nextInt(); int []p=new int [n+2]; for(int i=1;i<=n;i++){ p[i]=sc.nextInt(); } p[0]=0;p[n+1]=l; d=new double[n+2]; for(int i=0;i<n+2;i++){ d[i]=0; } for(int i=1;i<n+2;i++){ double min=Integer.MAX_VALUE; int dis; for(int j=0;j<i;j++){ dis =p[i]-p[j]; time = dis >c?(1.0*c/vt1+(dis-c)*1.0/vt2):(1.0*dis/vt1);//时间 if(j!=0) time =time+t; if(time + d[j]< min)// min = time + d[j]; } d[i]=min; } String s = d[n+1]<1.0*l/vr?"What a pity rabbit!":"Good job,rabbit!"; System.out.println(s); } } }
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   ^
0_0_31972567_5946\Main.java:1: 错误: 解析时已到达文件结尾
import java.util.*; class Main{ static int t,l,n,c,vr,vt1,vt2; static double []d; static double time; public static void main(String args[]){ Scanner sc= new Scanner(System.in); while(sc.hasNext()) { l=sc.nextInt(); n=sc.nextInt(); c=sc.nextInt(); t=sc.nextInt(); vr=sc.nextInt(); vt1=sc.nextInt(); vt2=sc.nextInt(); int []p=new int [n+2]; for(int i=1;i<=n;i++){ p[i]=sc.nextInt(); } p[0]=0;p[n+1]=l; d=new double[n+2]; for(int i=0;i<n+2;i++){ d[i]=0; } for(int i=1;i<n+2;i++){ double min=Integer.MAX_VALUE; int dis; for(int j=0;j<i;j++){ dis =p[i]-p[j]; time = dis >c?(1.0*c/vt1+(dis-c)*1.0/vt2):(1.0*dis/vt1);//时间 if(j!=0) time =time+t; if(time + d[j]< min)// min = time + d[j]; } d[i]=min; } String s = d[n+1]<1.0*l/vr?"What a pity rabbit!":"Good job,rabbit!"; System.out.println(s); } } }
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        ^
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-10-06 19:24:55, Gzip enabled