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_38603932_16415\Main.java:2: 错误: 需要class, interface或enum
1 #include
^
0_0_38603932_16415\Main.java:2: 错误: 非法字符: '#'
1 #include
  ^
0_0_38603932_16415\Main.java:4: 错误: 非法字符: '#'
2 #include
  ^
0_0_38603932_16415\Main.java:6: 错误: 非法字符: '#'
3 #include
  ^
0_0_38603932_16415\Main.java:8: 错误: 非法字符: '#'
4 #include
  ^
0_0_38603932_16415\Main.java:10: 错误: 需要class, interface或enum
5 using namespacestd;6
                     ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                              ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                           ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                               ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                 ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                             ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                      ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                                 ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                                         ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                                                                 ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                                                                        ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a[i]<<1;120 a[i]+=x;121 }122 }123 solve(n,m);124 }125 return 0;126 }
                                                                                                                                                                                                 ^
0_0_38603932_16415\Main.java:12: 错误: 需要class, interface或enum
7 int state[170],Num[170],len;8 int a[102];9 int befor[170][170],now[170][170];10 voidInit()11 {12 int i,k=1<<10;13 intans,x;14 len=0;15 for(i=0;i>2)) );18 else{19 state[len]=i;20 x=i;21 ans=0;22 while(x)23 {24 ans++;25 x=(x-1)&x;26 }27 Num[len++]=ans;28 }29 }30 }31 void make_Init(int n,intm)32 {33 int i,j,k=1<>1)&state[j]) ) continue;56 befor[i][j]=Num[i]+Num[j];57 if(hxl>1)&state[s]) ) continue;81 hxl=0;82 for(t=0;t>1)&state[t]) ) continue;86 if(hxl0)112 {113 for(i=1;i<=n;i++)114 {115 a[i]=0;116 for(j=1;j<=m;j++)117 {118 scanf("%d",&x);119 a[i]=a


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-11-29 11:59:33, Gzip enabled