submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 3 values | code stringlengths 1 522k | compiler_output stringlengths 43 10.2k |
|---|---|---|---|---|
s016488772 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
return;
}
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
3 errors
|
s274279418 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
}
return;
}
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
Main.java:73: error: class, interface, enum, or record expected
}
^
4 errors
|
s310833983 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
}
return;
}
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
Main.java:73: error: class, interface, enum, or record expected
}
^
4 errors
|
s178370761 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(i,j);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
}
return;
}
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
Main.java:73: error: class, interface, enum, or record expected
}
^
4 errors
|
s872067969 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(i,j);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
3 errors
|
s821955742 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
kukaku(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void kukaku(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
kukaku(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
3 errors
|
s682364275 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
dfs(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0;i<H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i<H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i<H;i++){
^
3 errors
|
s834719190 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0;i< H;i++){
for(int j=0;j<W;j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(k[i][j]!="."){
dfs(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0;i< H;i++){
^
Main.java:13: error: > or ',' expected
for(int i=0;i< H;i++){
^
Main.java:13: error: <identifier> expected
for(int i=0;i< H;i++){
^
3 errors
|
s175911268 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i<=H-1; i++){
for(int j=0; j<=W-1; j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0; i<=H-1; i++){
for(int j=0; j<=W-1; j++){
if(k[i][j]!="."){
dfs(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<=3;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0; i<=H-1; i++){
^
Main.java:13: error: <identifier> expected
for(int i=0; i<=H-1; i++){
^
Main.java:13: error: <identifier> expected
for(int i=0; i<=H-1; i++){
^
Main.java:13: error: <identifier> expected
for(int i=0; i<=H-1; i++){
^
4 errors
|
s636990645 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(k,i,j,H,W);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:13: error: illegal start of type
for(int i=0; i< H; i++){
^
Main.java:13: error: > or ',' expected
for(int i=0; i< H; i++){
^
Main.java:13: error: <identifier> expected
for(int i=0; i< H; i++){
^
3 errors
|
s875254973 | p00118 | Java | import java.util.*;
public class Main{
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
public static void main(String[] args){
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:7: error: illegal start of type
for(int i=0; i< H; i++){
^
Main.java:7: error: > or ',' expected
for(int i=0; i< H; i++){
^
Main.java:7: error: <identifier> expected
for(int i=0; i< H; i++){
^
3 errors
|
s516837892 | p00118 | Java | public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j,H,W,k);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(final int I,final int J,final int H,final int W,String[][] k){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i],H,W,k);
}
}
return;
}
} | Main.java:3: error: cannot find symbol
Scanner sc=new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:3: error: cannot find symbol
Scanner sc=new Scanner(System.in);
^
symbol: class Scanner
location: class Main
2 errors
|
s176868313 | p00118 | Java | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
private int H=sc.nextInt();
private int W=sc.nextInt();
private String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j);
num++;
}
}
}
System.out.println(num);
}
void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:5: error: illegal start of expression
private int H=sc.nextInt();
^
Main.java:8: error: illegal start of type
for(int i=0; i< H; i++){
^
Main.java:8: error: > or ',' expected
for(int i=0; i< H; i++){
^
Main.java:8: error: <identifier> expected
for(int i=0; i< H; i++){
^
Main.java:14: error: illegal start of type
for(int i=0; i<H; i++){
^
Main.java:14: error: > or ',' expected
for(int i=0; i<H; i++){
^
Main.java:14: error: <identifier> expected
for(int i=0; i<H; i++){
^
Main.java:22: error: <identifier> expected
System.out.println(num);
^
Main.java:22: error: <identifier> expected
System.out.println(num);
^
Main.java:24: error: unnamed classes are a preview feature and are disabled by default.
void dfs(int I,int J){
^
(use --enable-preview to enable unnamed classes)
Main.java:36: error: class, interface, enum, or record expected
}
^
11 errors
|
s148507788 | p00118 | Java | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j);
num++;
}
}
}
System.out.println(num);
}
void dfs(int I,int J){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i]);
}
}
return;
}
} | Main.java:17: error: non-static method dfs(int,int) cannot be referenced from a static context
dfs(i,j);
^
Main.java:25: error: cannot find symbol
String p=k[I][J];
^
symbol: variable k
location: class Main
Main.java:26: error: cannot find symbol
k[I][J]=".";
^
symbol: variable k
location: class Main
Main.java:30: error: cannot find symbol
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
^
symbol: variable k
location: class Main
Main.java:30: error: cannot find symbol
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
^
symbol: variable H
location: class Main
Main.java:30: error: cannot find symbol
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
^
symbol: variable W
location: class Main
6 errors
|
s393822975 | p00118 | Java | public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j,H,W,k);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(final int I,final int J,final int H,final int W,String[][] k){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i],H,W,k);
}
}
return;
}
} | Main.java:3: error: cannot find symbol
Scanner sc=new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:3: error: cannot find symbol
Scanner sc=new Scanner(System.in);
^
symbol: class Scanner
location: class Main
2 errors
|
s348973309 | p00118 | Java | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j,H,W,k);
num++;
}
}
}
System.out.println(num);
}
void dfs(final int I,final int J,final int H,final int W,String[][] k){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int i=0;i<4;i++){
if(p==k[I+dx[i]][J+dy[i]]&&I+dx[i]>=0&&I+dx[i]<H&&J+dy[i]>=0&&J+dy[i]<W){
dfs(I+dx[i],J+dy[i],H,W,k);
}
}
return;
}
} | Main.java:17: error: non-static method dfs(int,int,int,int,String[][]) cannot be referenced from a static context
dfs(i,j,H,W,k);
^
1 error
|
s307768455 | p00118 | Java | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
for(int j=0; j< W; j++){
k[i][j]=sc.next();
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j,H,W,k);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J,final int H,final int W,String[][] k){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int t=0;t<4;t++){
if(p==k[I+dx[t]][J+dy[t]]&&I+dx[i]>=0&&I+dx[t]<H&&J+dy[t]>=0&&J+dy[t]<W){
dfs(I+dx[t],J+dy[t],H,W,k);
}
}
return;
}
} | Main.java:30: error: cannot find symbol
if(p==k[I+dx[t]][J+dy[t]]&&I+dx[i]>=0&&I+dx[t]<H&&J+dy[t]>=0&&J+dy[t]<W){
^
symbol: variable i
location: class Main
1 error
|
s577895631 | p00118 | Java | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
String[][] k=new String[H][W];
for(int i=0; i< H; i++){
String s=sc.next();
for(int j=0; j< W; j++){
k[i][j]=s.charAt(j);
}
}
int num=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(k[i][j]!="."){
dfs(i,j,H,W,k);
num++;
}
}
}
System.out.println(num);
}
public static void dfs(int I,int J,final int H,final int W,String[][] k){
String p=k[I][J];
k[I][J]=".";
int[] dx={-1,0,0,1};
int[] dy={0,-1,1,0};
for(int t=0;t<4;t++){
if(p==k[I+dx[t]][J+dy[t]]&&I+dx[t]>=0&&I+dx[t]<H&&J+dy[t]>=0&&J+dy[t]<W){
dfs(I+dx[t],J+dy[t],H,W,k);
}
}
return;
}
} | Main.java:11: error: incompatible types: char cannot be converted to String
k[i][j]=s.charAt(j);
^
1 error
|
s690183169 | p00118 | Java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.awt.Point;
import java.util.Deque;
import java.util.ArrayDeque;
class Main{
public static void main(String[] args) throws IOExeption{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str;
while(!(str=br.readLine()).equals("0 0")){
String[] value=str.split(" ");
int h=Integer.parseInt(value[0]);
int w=Integer.parseInt(value[1]);
char[][] fruit=new char[h][w];
for(int i=0;i<h;i++){
fruit[i]=br.readLine().toCharArray();
}
Deque<Point> que=new ArrayDeque<Point>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(fruit[m][n]!=','){
ans++;
Point p=new Point(n,m);
que.offerLast(p);
while(que.peekFirst()!=null){
p=que.pollFirst();
int x=p.x;
int y=p.y;
char rem=fruit[y][x];
fruit[x][y]=',';
int[] dx={-1,0,1,0};
int[] dy={0,-1,0,1};
for(int i=0;i<dx.length;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(fruit[ny][nx]==rem&&fruit[ny][nx]!=','&&nx>=0&&nx<w&&ny>=0&&ny<h){
Point np=new Point();
np.x=nx;
np.y=ny;
que.offerFirst(np);
}
}
}
}
}
}
System.out.println(ans);
}
}
} | Main.java:9: error: cannot find symbol
public static void main(String[] args) throws IOExeption{
^
symbol: class IOExeption
location: class Main
1 error
|
s051038541 | p00118 | Java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.awt.Point;
import java.util.*;
class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str;
while(!(str=br.readLine()).equals("0 0")){
String[] value=str.split(" ");
int h=Integer.parseInt(value[0]);
int w=Integer.parseInt(value[1]);
char[][] fruit=new char[h][w];
for(int i=0;i<h;i++){
fruit[i]=br.readLine().toCharArray();
}
Queue <Point> fifo =new LinkedList<Point>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(map[m][n]!='.'){
ans++;
Point p = new Point(n,m);
fifo.add(p);
while(fifo.peek()!=null){
p=fifo.poll();
int x=p.x;
int y=p.y;
char crop = map[y][x];
map[y][x]='.';
int [] dx ={0,1,0,-1};
int [] dy ={1,0,-1,0};
for(int i=0;i<4;i++){
int nx =x+dx[i];
int ny =y+dy[i];
if(0<=nx&&nx<w&&0<=ny&&ny<h&&map[ny][nx]==crop&&map[ny][nx]!='.'){
Point np = new Point();
np.x=nx;
np.y=ny;
fifo.add(np);
}
}
}
}
}
}System.out.println(ans);
}
}
} | Main.java:23: error: cannot find symbol
if(map[m][n]!='.'){
^
symbol: variable map
location: class Main
Main.java:31: error: cannot find symbol
char crop = map[y][x];
^
symbol: variable map
location: class Main
Main.java:32: error: cannot find symbol
map[y][x]='.';
^
symbol: variable map
location: class Main
Main.java:39: error: cannot find symbol
if(0<=nx&&nx<w&&0<=ny&&ny<h&&map[ny][nx]==crop&&map[ny][nx]!='.'){
^
symbol: variable map
location: class Main
Main.java:39: error: cannot find symbol
if(0<=nx&&nx<w&&0<=ny&&ny<h&&map[ny][nx]==crop&&map[ny][nx]!='.'){
^
symbol: variable map
location: class Main
5 errors
|
s582751108 | p00118 | Java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.awt.Point;
import java.util.*;
class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str;
while(!(str=br.readLine()).equals("0 0")){
String[] value=str.split(" ");
int h=Integer.parseInt(value[0]);
int w=Integer.parseInt(value[1]);
char[][] map=new char[h][w];
for(int i=0;i<h;i++){
map[i]=br.readLine().toCharArray();
}
Deque <Point> fifo =new Arraydeque<Point>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(map[m][n]!='.'){
ans++;
Point p = new Point(n,m);
fifo.addLast(p);
while(fifo.peekFirst()!=null){
p=fifo.pollFirst();
int x=p.x;
int y=p.y;
char crop = map[y][x];
map[y][x]='.';
int [] dx ={0,1,0,-1};
int [] dy ={1,0,-1,0};
for(int i=0;i<4;i++){
int nx =x+dx[i];
int ny =y+dy[i];
if(0<=nx&&nx<w&&0<=ny&&ny<h&&map[ny][nx]==crop&&map[ny][nx]!='.'){
Point np = new Point();
np.x=nx;
np.y=ny;
fifo.addLast(np);
}
}
}
}
}
}System.out.println(ans);
}
}
} | Main.java:19: error: cannot find symbol
Deque <Point> fifo =new Arraydeque<Point>();
^
symbol: class Arraydeque
location: class Main
1 error
|
s667499100 | p00118 | Java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.awt.Point;
import java.util.*;
class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str;
while(!(str=br.readLine()).equals("0 0")){
String[] value=str.split(" ");
int h=Integer.parseInt(value[0]);
int w=Integer.parseInt(value[1]);
char[][] map=new char[h][w];
for(int i=0;i<h;i++){
map[i]=br.readLine().toCharArray();
}
Deque <Point> que=new ArrayDeque<Point>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(map[m][n]!='.'){
ans++;
Point p = new Point(n,m);
fifo.addLast(p);
while(fifo.peekFirst()!=null){
p=fifo.pollFirst();
int x=p.x;
int y=p.y;
char crop = map[y][x];
map[y][x]='.';
int [] dx ={0,1,0,-1};
int [] dy ={1,0,-1,0};
for(int i=0;i<4;i++){
int nx =x+dx[i];
int ny =y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&map[ny][nx]!='.'&&map[ny][nx]==crop){
Point np = new Point();
np.x=nx;
np.y=ny;
fifo.addLast(np);
}
}
}
}
}
}System.out.println(ans);
}
}
} | Main.java:26: error: cannot find symbol
fifo.addLast(p);
^
symbol: variable fifo
location: class Main
Main.java:27: error: cannot find symbol
while(fifo.peekFirst()!=null){
^
symbol: variable fifo
location: class Main
Main.java:28: error: cannot find symbol
p=fifo.pollFirst();
^
symbol: variable fifo
location: class Main
Main.java:42: error: cannot find symbol
fifo.addLast(np);
^
symbol: variable fifo
location: class Main
4 errors
|
s127707809 | p00118 | Java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.awt.Point;
import java.util.*;
class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str;
while(!(str=br.readLine()).equals("0 0")){
String[] value=str.split(" ");
int h=Integer.parseInt(value[0]);
int w=Integer.parseInt(value[1]);
char[][] map=new char[h][w];
for(int i=0;i<h;i++){
map[i]=br.readLine().toCharArray();
}
Deque <Point> que=new ArrayDeque<Point>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(map[m][n]!='.'){
ans++;
Point p = new Point(n,m);
fifo.addLast(p);
while(que.peekFirst()!=null){
p=que.pollFirst();
int x=p.x;
int y=p.y;
char crop = map[y][x];
map[y][x]='.';
int [] dx ={0,1,0,-1};
int [] dy ={1,0,-1,0};
for(int i=0;i<4;i++){
int nx =x+dx[i];
int ny =y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&map[ny][nx]!='.'&&map[ny][nx]==crop){
Point np = new Point();
np.x=nx;
np.y=ny;
que.addLast(np);
}
}
}
}
}
}System.out.println(ans);
}
}
} | Main.java:26: error: cannot find symbol
fifo.addLast(p);
^
symbol: variable fifo
location: class Main
1 error
|
s451928856 | p00118 | Java | import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class Main{
static FastReader in = new FastReader();
static int[][] separate;
static char[][] land;
static int h;
static int w;
public static void main(String[] args) {
h = in.nextInt();
w = in.nextInt();
land = in.nextCharArray2d(h, w);
int zero = in.nextInt();
zero = in.nextInt();
separate = new int[h][w];
int owner = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (separate[i][j] > 0) continue;
dfs(i, j, land[i][j], ++owner);
}
}
printExit(owner);
}
private static void dfs(int i, int j, char type, int owner) {
if (land[i][j] != type || separate[i][j] > 0) return;
separate[i][j] = owner;
if (j > 0) dfs(i, j - 1, type, owner);
if (i > 0) dfs(i - 1, j, type, owner);
if (j < w - 1) dfs(i, j + 1, type, owner);
if (i < h - 1) dfs(i + 1, j, type, owner);
}
static void printExit(Object msg) {
System.out.println(msg);
System.exit(0);
}
}
class FastReader{
private InputStream in = System.in;
private byte[] buf = new byte[1024];
private int charNum;
private int charLen;
private StringBuilder sb = new StringBuilder();
public int read() {
if (charLen == -1) throw new InputMismatchException();
if (charNum >= charLen) {
charNum = 0;
try {
charLen = in.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (charLen <= 0) return -1;
}
return buf[charNum++];
}
public String next() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
sb.setLength(0);
do {
sb.appendCodePoint(c);
c = read();
} while (!isWhitespace(c));
return sb.toString();
}
public char[] nextCharArray() {
return next().toCharArray();
}
public char[][] nextCharArray2d(int lines, int rows) {
char[][] array = new char[lines][rows];
for (int i = 0; i < lines; i++)
array[i] = nextCharArray();
return array;
}
public boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
} | Main.java:13: error: cannot find symbol
h = in.nextInt();
^
symbol: method nextInt()
location: variable in of type FastReader
Main.java:14: error: cannot find symbol
w = in.nextInt();
^
symbol: method nextInt()
location: variable in of type FastReader
Main.java:16: error: cannot find symbol
int zero = in.nextInt();
^
symbol: method nextInt()
location: variable in of type FastReader
Main.java:17: error: cannot find symbol
zero = in.nextInt();
^
symbol: method nextInt()
location: variable in of type FastReader
4 errors
|
s456007590 | p00118 | Java | import java.util.Scanner;
/**
* Created by sotetsuk on 2015/07/07.
*/
public class AOJ0118 {
static int h, w;
static int[] dx = {0, 1, 0, -1};
static int[] dy = {1, 0, -1, 0};
static char[][] grid = new char[105][105];
static int ans = 0;
public static void dfs(int i, int j , char c) {
// stopping condition
if(i < 0 || i >= h || j < 0 || j >= w) return;
if(grid[i][j] != c) return;
// marking where already visit
grid[i][j] = '.';
// recursion
for(int k = 0; k < 4; k++) dfs(i + dx[k], j + dy[k], c);
}
public static void main(String[] args) {
// input
Scanner sc = new Scanner(System.in);
h = sc.nextInt();
w = sc.nextInt();
for(int i = 0; i < h; i++) {
grid[i] = sc.next().toCharArray();
}
// dfs
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(grid[i][j] != '.') {
ans++;
dfs(i, j, grid[i][j]);
}
}
}
System.out.println(ans);
}
} | Main.java:6: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s499764830 | p00118 | Java | import java.util.Scanner;
/**
* Created by sotetsuk on 2015/07/07.
*/
public class AOJ0118 {
static Scanner sc = new Scanner(System.in);
static int h, w;
static int[] dx = {0, 1, 0, -1};
static int[] dy = {1, 0, -1, 0};
static char[][] grid = new char[105][105];
public static void dfs(int i, int j , char c) {
// stopping condition
if(i < 0 || i >= h || j < 0 || j >= w) return;
if(grid[i][j] != c) return;
// marking where already visit
grid[i][j] = '.';
// recursion
for(int k = 0; k < 4; k++) dfs(i + dx[k], j + dy[k], c);
return;
}
public static void solve() {
int ans = 0;
// input
for(int i = 0; i < h; i++) {
grid[i] = sc.next().toCharArray();
}
// dfs
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(grid[i][j] != '.') {
ans++;
dfs(i, j, grid[i][j]);
}
}
}
System.out.println(ans);
return;
}
public static void main(String[] args) {
while(true) {
h = sc.nextInt();
w = sc.nextInt();
if(h == 0 && w == 0) break;
solve();
}
return;
}
} | Main.java:6: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s218845549 | p00118 | Java | import java.util.Scanner;
/**
* Created by sotetsuk on 2015/07/07.
*/
public class AOJ0118 {
static Scanner sc = new Scanner(System.in);
static int h, w;
static int[] dx = {0, 1, 0, -1};
static int[] dy = {1, 0, -1, 0};
static char[][] grid = new char[105][105];
public static boolean read() {
h = sc.nextInt();
w = sc.nextInt();
if(h == 0 && w == 0) return false;
for(int i = 0; i < h; i++) {
grid[i] = sc.next().toCharArray();
}
return true;
}
public static void dfs(int i, int j , char c) {
// stopping condition
if(i < 0 || i >= h || j < 0 || j >= w) return;
if(grid[i][j] != c) return;
// marking where already visit
grid[i][j] = '.';
// recursion
for(int k = 0; k < 4; k++) dfs(i + dx[k], j + dy[k], c);
return;
}
public static void solve() {
int ans = 0;
// dfs
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(grid[i][j] != '.') {
ans++;
dfs(i, j, grid[i][j]);
}
}
}
System.out.println(ans);
}
public static void main(String[] args) {
while(read()) {
solve();
}
}
} | Main.java:6: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s694112965 | p00118 | Java | import java.util.Scanner;
/**
* Created by sotetsuk on 2015/07/07.
*/
public class Main{
static Scanner sc = new Scanner(System.in);
static int h, w;
static int[] dx = {0, 1, 0, -1};
static int[] dy = {1, 0, -1, 0};
static char[][] grid = new char[105][105];
public static boolean read() {
h = sc.nextInt();
w = sc.nextInt();
if(h == 0 && w == 0) return false;
for(int i = 0; i < h; i++) {
grid[i] = sc.next().toCharArray();
}
return true;
}
public static void dfs(int i, int j , char c) {
return;
// stopping condition
if(i < 0 || i >= h || j < 0 || j >= w) return;
if(grid[i][j] == '.') return;
// marking
grid[i][j] = '.';
// recursion
for(int k = 0; k < 4; k++) dfs(i + dx[k], j + dy[k], c);
}
public static void solve() {
int ans = 0;
// dfs
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(grid[i][j] != '.') {
ans++;
dfs(i, j, grid[i][j]);
}
}
}
System.out.println(ans);
}
public static void main(String[] args) {
while(read()) solve();
}
} | Main.java:29: error: unreachable statement
if(i < 0 || i >= h || j < 0 || j >= w) return;
^
1 error
|
s906840330 | p00118 | Java | import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;
public class Main{
static PrintWriter out;
static InputReader ir;
static void solve(){
for(;;){
int h=ir.nextInt();
int w=ir.nextInt();
if(h==0&&w==0) return;
char[][] map=ir.nextCharMap(h,w);
Deque<int[]> que=new ArrayDeque<>();
int ans=0;
for(int m=0;m<h;m++){
for(int n=0;n<w;n++){
if(map[m][n]!='.'){
ans++;
que.addLast(new int[]{n,m});
while(!que.isEmpty()){
int[] p=que.pollFirst();
char crop = map[p[1]][p[0]];
map[p[1]][p[0]]='.';
for(int i=0;i<4;i++){
int nx =p[0]+d[i];
int ny =p[1]+d[i^1];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&map[ny][nx]!='.'&&map[ny][nx]==crop) que.addLast(new int[]{nx,ny});
}
}
}
}
}
out.println(ans);
}
}
public static void main(String[] args) throws Exception{
ir=new InputReader(System.in);
out=new PrintWriter(System.out);
solve();
out.flush();
}
static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
public boolean hasNextByte() {
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}catch(IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0) return false;
}
return true;
}
private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
public boolean hasNext(){skip(); return hasNextByte();}
public String next(){
if(!hasNext()) throw new NoSuchElementException();
StringBuilder sb=new StringBuilder();
int b=readByte();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
public int nextInt() {
if(!hasNext()) throw new NoSuchElementException();
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}
public long nextLong() {
if(!hasNext()) throw new NoSuchElementException();
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}
public double nextDouble(){return Double.parseDouble(next());}
public int[] nextIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
public long[] nextLongArray(int n){
long[] a=new long[n];
for(int i=0;i<n;i++) a[i]=nextLong();
return a;
}
public char[][] nextCharMap(int n,int m){
char[][] map=new char[n][m];
for(int i=0;i<n;i++) map[i]=next().toCharArray();
return map;
}
}
} | Main.java:36: error: cannot find symbol
int nx =p[0]+d[i];
^
symbol: variable d
location: class Main
Main.java:37: error: cannot find symbol
int ny =p[1]+d[i^1];
^
symbol: variable d
location: class Main
2 errors
|
s048360565 | p00118 | Java | package aoj0118;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* author: Acrafter
* date: 2017/1/11
* time: 22:03
*/
public class aoj0118 {
private static char[][] farm = new char[100][100];
private static int[] dx = {1, -1, 0, 0}, dy = {0, 0, 1, -1};
private static int result = 0;
private static int H, W;
public static void main(String[] args) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
String[] HW = input.readLine().split(" ");
H = Integer.parseInt(HW[0]); W = Integer.parseInt(HW[1]);
for (int y = 0; y < H; y++) {
char[] line = input.readLine().toCharArray();
farm[y] = line;
}
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
if(farm[y][x]!='W'){
dfs(y, x, farm[y][x]);
result += 1;
}
}
}
System.out.println(result);
result = 0;
}
public static void dfs(int y, int x, char flag){
farm[y][x] = 'W'; // ?????°??°???
for(int i=0; i<4; i++){
int ny = y + dy[i], nx = x + dx[i];
if (0<=ny && ny<H && 0<=nx && nx<W && farm[ny][nx]==flag) {
dfs(ny, nx, flag);
}
}
}
} | Main.java:12: error: class aoj0118 is public, should be declared in a file named aoj0118.java
public class aoj0118 {
^
1 error
|
s580855981 | p00118 | Java | import java.util.*;
public class AOJ0118 {
private static char[][] room;
private static boolean[][] roomVisited;
private static int count;
private static int[][] directions = {{1,0}, {0,1}, {0,-1}, {-1,0}};
public static void main(String[] args) {
test();
Scanner sc = new Scanner(System.in);
int w, h;
String lineOfInput;
while(true) {
w = sc.nextInt();
h = sc.nextInt();
if (w == 0 && h == 0) break;
room = new char[h][w];
roomVisited = new boolean[h][w];
for (boolean[] row: roomVisited)
Arrays.fill(row, false);
count = 0;
sc.nextLine(); // for empty line
for (int i = 0; i < h; i++) {
lineOfInput = sc.nextLine();
for (int j = 0; j < w; j++) {
room[i][j] = lineOfInput.charAt(j);
}
}
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
if (!roomVisited[y][x]) {
roomVisited[y][x] = true;
dfs(x, y);
count++;
}
}
}
System.out.println(count);
}
}
private static void dfs(int x, int y) {
int nx, ny;
for (int[] direction: directions) {
nx = x + direction[0];
ny = y + direction[1];
if (nx >= 0 && ny >= 0 && nx < room[0].length && ny < room.length) {
if (!roomVisited[ny][nx] && room[y][x] == room[ny][nx]) {
roomVisited[ny][nx] = true;
dfs(nx, ny);
}
}
}
}
private static int calc(int x) {
return x;
}
private static void test() {
assert calc(0) == 0;
}
} | Main.java:3: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s825881003 | p00118 | Java | import java.util.*;
public class AOJ0118 {
private static char[][] room;
private static boolean[][] roomVisited;
private static int count;
private static int[][] directions = {{1,0}, {0,1}, {0,-1}, {-1,0}};
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w, h;
String lineOfInput;
while(true) {
w = sc.nextInt();
h = sc.nextInt();
if (w == 0 && h == 0) break;
room = new char[h][w];
roomVisited = new boolean[h][w];
for (boolean[] row: roomVisited)
Arrays.fill(row, false);
count = 0;
sc.nextLine(); // for empty line
for (int i = 0; i < h; i++) {
lineOfInput = sc.nextLine();
for (int j = 0; j < w; j++) {
room[i][j] = lineOfInput.charAt(j);
}
}
// for (int y = 0; y < h; y++) {
// for (int x = 0; x < w; x++) {
// if (!roomVisited[y][x]) {
// roomVisited[y][x] = true;
// dfs(x, y);
// count++;
// }
// }
// }
System.out.println(count);
}
}
private static void dfs(int x, int y) {
int nx, ny;
for (int[] direction: directions) {
nx = x + direction[0];
ny = y + direction[1];
if (nx >= 0 && ny >= 0 && nx < room[0].length && ny < room.length) {
if (!roomVisited[ny][nx] && room[y][x] == room[ny][nx]) {
roomVisited[ny][nx] = true;
dfs(nx, ny);
}
}
}
}
} | Main.java:3: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s500534879 | p00118 | Java | import java.util.*;
public class AOJ0118 {
private static char[][] room;
private static boolean[][] roomVisited;
private static int count;
private static int[][] directions = {{1,0}, {0,1}, {0,-1}, {-1,0}};
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w, h;
String lineOfInput;
while(true) {
w = sc.nextInt();
h = sc.nextInt();
if (w == 0 && h == 0) break;
room = new char[h][w];
roomVisited = new boolean[h][w];
for (boolean[] row: roomVisited)
Arrays.fill(row, false);
count = 0;
sc.nextLine(); // for empty line
// for (int i = 0; i < h; i++) {
// lineOfInput = sc.nextLine();
// for (int j = 0; j < w; j++) {
// room[i][j] = lineOfInput.charAt(j);
// }
// }
// for (int y = 0; y < h; y++) {
// for (int x = 0; x < w; x++) {
// if (!roomVisited[y][x]) {
// roomVisited[y][x] = true;
// dfs(x, y);
// count++;
// }
// }
// }
System.out.println(count);
}
}
private static void dfs(int x, int y) {
int nx, ny;
for (int[] direction: directions) {
nx = x + direction[0];
ny = y + direction[1];
if (nx >= 0 && ny >= 0 && nx < room[0].length && ny < room.length) {
if (!roomVisited[ny][nx] && room[y][x] == room[ny][nx]) {
roomVisited[ny][nx] = true;
dfs(nx, ny);
}
}
}
}
} | Main.java:3: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s491149891 | p00118 | Java | import java.io.*;
public class AOJ0118{
public static void main(String args[]){
AOJ0118 a = new AOJ0118();
}
public AOJ0118(){
setMap();
//showMap();
run();
}
String[][] map;
private void showMap(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
System.out.print(map[i][j]);
}
System.out.println("");
}
System.out.println("");
}
private void setMap(){
try{
BufferedReader stdReader = new BufferedReader(new InputStreamReader(System.in));
int H = -1;
int W = -1;
int expected = 0;
String line = "";
int tempH = 0;
while(!(line = stdReader.readLine()).equals("0 0")) {
if(W==-1){
H = Integer.valueOf(line.split(" ")[0]);
W = Integer.valueOf(line.split(" ")[1]);
map = new String[H][W];
}else if(!line.equals("0 0")){
setLine(tempH, line);
tempH += 1;
}
}
stdReader.close();
System.out.println("\nPROGRAM END");
}catch(Exception e){
e.getStackTrace();
System.exit(-1); // ????????°???????????????
}
}
private void run(){
int person = 0;
int[] point;
while((point = getPointOfNotSearcherArea()) != null){
search(point);
person++;
}
System.out.println(person);
}
private void search(int[] point){
int x = point[0];
int y = point[1];
String temp = map[x][y];
map[x][y] = "_";
for(int diff = -1; diff<=1; diff++){
if(x+diff>=0 && x+diff<map.length){
if(map[x+diff][y].equals(temp)&&!map[x+diff][y].equals("_")){
int[] neoPoint = {x+diff, y};
search(neoPoint);
}
}
if(y+diff>=0 && y+diff<map.length){
if(map[x][y+diff].equals(temp)&&!map[x][y+diff].equals("_")){
int[] neoPoint = {x, y+diff};
search(neoPoint);
}
}
}
//showMap();
//System.out.println("");
}
private int[] getPointOfNotSearcherArea(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
if(!map[i][j].equals("_")){
int point[] = {i,j};
return point;
}
}
}
return null;
}
private void setLine(int tempH, String input){
for(int i = 0; i < map[tempH].length; i++){
String entity = input.substring(i,i+1);
map[tempH][i] = entity;
}
}
}
| Main.java:2: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118{
^
1 error
|
s546462137 | p00118 | Java | import java.io.*;
public class Main{
public static void main(String args[]){
Main a = new AOJ0118();
}
public AOJ0118(){
setMap();
//showMap();
run();
}
String[][] map;
private void showMap(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
System.out.print(map[i][j]);
}
System.out.println("");
}
System.out.println("");
}
private void setMap(){
try{
BufferedReader stdReader = new BufferedReader(new InputStreamReader(System.in));
int H = -1;
int W = -1;
int expected = 0;
String line = "";
int tempH = 0;
while(!(line = stdReader.readLine()).equals("0 0")) {
if(W==-1){
H = Integer.valueOf(line.split(" ")[0]);
W = Integer.valueOf(line.split(" ")[1]);
map = new String[H][W];
}else if(!line.equals("0 0")){
setLine(tempH, line);
tempH += 1;
}
}
stdReader.close();
System.out.println("\nPROGRAM END");
}catch(Exception e){
e.getStackTrace();
System.exit(-1); // ????????°???????????????
}
}
private void run(){
int person = 0;
int[] point;
while((point = getPointOfNotSearcherArea()) != null){
search(point);
person++;
}
System.out.println(person);
}
private void search(int[] point){
int x = point[0];
int y = point[1];
String temp = map[x][y];
map[x][y] = "_";
for(int diff = -1; diff<=1; diff++){
if(x+diff>=0 && x+diff<map.length){
if(map[x+diff][y].equals(temp)&&!map[x+diff][y].equals("_")){
int[] neoPoint = {x+diff, y};
search(neoPoint);
}
}
if(y+diff>=0 && y+diff<map.length){
if(map[x][y+diff].equals(temp)&&!map[x][y+diff].equals("_")){
int[] neoPoint = {x, y+diff};
search(neoPoint);
}
}
}
//showMap();
//System.out.println("");
}
private int[] getPointOfNotSearcherArea(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
if(!map[i][j].equals("_")){
int point[] = {i,j};
return point;
}
}
}
return null;
}
private void setLine(int tempH, String input){
for(int i = 0; i < map[tempH].length; i++){
String entity = input.substring(i,i+1);
map[tempH][i] = entity;
}
}
}
| Main.java:7: error: invalid method declaration; return type required
public AOJ0118(){
^
1 error
|
s817481460 | p00118 | Java | import java.io.*;
public class Main{
public static void main(String args[]){
Main a = new Main();
}
public Main(){
setMap();
//showMap();
run();
}
String[][] map;
private void showMap(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
System.out.print(map[i][j]);
}
System.out.println("");
}
System.out.println("");
}
private void setMap(){
try{
BufferedReader stdReader = new BufferedReader(new InputStreamReader(System.in));
int H = -1;
int W = -1;
int expected = 0;
String line = "";
int tempH = 0;
while(!(line = stdReader.readLine())!=null) {
if(W==-1){
H = Integer.valueOf(line.split(" ")[0]);
W = Integer.valueOf(line.split(" ")[1]);
map = new String[H][W];
}else if(!line.equals("0 0")){
setLine(tempH, line);
tempH += 1;
}
}
stdReader.close();
}catch(Exception e){
e.getStackTrace();
}
}
private void run(){
int person = 0;
int[] point;
while((point = getPointOfNotSearcherArea()) != null){
search(point);
person++;
}
System.out.println(person);
}
private void search(int[] point){
int x = point[0];
int y = point[1];
String temp = map[x][y];
map[x][y] = "_";
for(int diff = -1; diff<=1; diff++){
if(x+diff>=0 && x+diff<map.length){
if(map[x+diff][y].equals(temp)&&!map[x+diff][y].equals("_")){
int[] neoPoint = {x+diff, y};
search(neoPoint);
}
}
if(y+diff>=0 && y+diff<map.length){
if(map[x][y+diff].equals(temp)&&!map[x][y+diff].equals("_")){
int[] neoPoint = {x, y+diff};
search(neoPoint);
}
}
}
//showMap();
//System.out.println("");
}
private int[] getPointOfNotSearcherArea(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
if(!map[i][j].equals("_")){
int point[] = {i,j};
return point;
}
}
}
return null;
}
private void setLine(int tempH, String input){
for(int i = 0; i < map[tempH].length; i++){
String entity = input.substring(i,i+1);
map[tempH][i] = entity;
}
}
}
| Main.java:34: error: bad operand type String for unary operator '!'
while(!(line = stdReader.readLine())!=null) {
^
1 error
|
s073827928 | p00118 | Java | import java.io.*;
public class Main{
public static void main(String args[]){
Main a = new Main();
a.run();
}
String[][] map;
private void showMap(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
System.out.print(map[i][j]);
}
System.out.println("");
}
System.out.println("");
}
public void run(){
try{
BufferedReader stdReader = new BufferedReader(new InputStreamReader(System.in));
int H = -1;
int W = -1;
String line = "";
int tempH = 0;
//(line = stdReader.readLine())!=null
while(true) {
if(W==-1 && !line.equals("")){
H = Integer.valueOf(line.split(" ")[0]);
W = Integer.valueOf(line.split(" ")[1]);
map = new String[H][W];
}else if(!line.equals("0 0")){
setLine(tempH, line);
tempH += 1;
}else if(line.equals("0 0")){
solve();
W = -1;
H = -1;
tempH = 0;
}
}
stdReader.close();
}catch(Exception e){
e.getStackTrace();
}
}
private void solve(){
int person = 0;
int[] point;
while((point = getPointOfNotSearcherArea()) != null){
search(point);
person++;
}
System.out.println(person);
}
private void search(int[] point){
int x = point[0];
int y = point[1];
String temp = map[x][y];
map[x][y] = "_";
for(int diff = -1; diff<=1; diff++){
if(x+diff>=0 && x+diff<map.length){
if(map[x+diff][y].equals(temp)&&!map[x+diff][y].equals("_")){
int[] neoPoint = {x+diff, y};
search(neoPoint);
}
}
if(y+diff>=0 && y+diff<map.length){
if(map[x][y+diff].equals(temp)&&!map[x][y+diff].equals("_")){
int[] neoPoint = {x, y+diff};
search(neoPoint);
}
}
}
}
private int[] getPointOfNotSearcherArea(){
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[0].length; j++){
if(!map[i][j].equals("_")){
int point[] = {i,j};
return point;
}
}
}
return null;
}
private void setLine(int tempH, String input){
for(int i = 0; i < map[tempH].length; i++){
String entity = input.substring(i,i+1);
map[tempH][i] = entity;
}
}
}
| Main.java:43: error: unreachable statement
stdReader.close();
^
1 error
|
s651218892 | p00118 | Java | public class Main{
private static int n; //???
private static int m; //???
private static char[][] map;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNextInt()) {
n = scanner.nextInt();
m = scanner.nextInt();
if (n==0&&m==0) {
break;
}
int step = 0; //??°????¬???°
map = new char[n][m];
for (int i=0;i<n;i++) {
String str = scanner.next();
for (int j=0;j<m;j++) {
map[i][j] = str.charAt(j);
}
}
for (int i=0;i<n;i++) {
for (int j=0;j<m;j++) {
if (map[i][j]!='+') {
dfs(i,j,map[i][j]);
step++;
}
}
}
System.out.println(step);
}
}
private static void dfs(int i, int j,char c) {
map[i][j] = '+';
//??????????????????---???????§??????????????????????????????\??????????????????????????????
//for (int a=-1;a<2;a++) {
//for (int b=-1;b<2;b++) {
//------------------
//???????????????????????§??¶??????
int d[][] = {{0,1},{0,-1},{1,0},{-1,0}};
for (int a=0;a<4;a++) {
//?§???¨????????????(nx,ny);
int nx = i+d[a][0];
int ny = j+d[a][1];
//??????(nx,ny)???????????¨??¢???????????¶?????????????°´???
if (nx<n&&nx>=0&&ny<m&&ny>=0&&map[nx][ny]==c) {
dfs(nx,ny,c);
}
}
}
} | Main.java:7: error: cannot find symbol
Scanner scanner = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:7: error: cannot find symbol
Scanner scanner = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
2 errors
|
s016013668 | p00118 | Java | import java.io.IOException;
import java.lang.reflect.Array;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
while(true) {
int H = in.nextInt();
int W = in.nextInt();
if(H == 0 && W == 0) return 0;
in.nextLine();
String[] map = new String[H + 200];
String str = "";
for (int i = 0; i < W + 2; i++) {
str += ".";
}
map[0] = str;
for (int i = 1; i <= H; i++) {
String s = in.nextLine();
map[i] = "." + s + ".";
}
map[H + 1] = str;
solve(H, W, map);
}
return 0;
}
public static void print(String[] map, int H, int W) {
for(int i=0;i<H+2;i++) {
for(int j=0;j<W+2;j++) {
System.out.print(map[i].charAt(j));
}
System.out.println("");
}
}
public static void solve(int H, int W, String[] map) {
// print(map, H, W);
boolean visited[][] = new boolean[H+200][W+200];
int ans = 0;
for(int i=1;i<=H;i++) {
for(int j=1;j<=W;j++) {
if(!visited[i][j]) {
dfs(visited, map, ""+map[i].charAt(j), i, j);
ans++;
}
}
}
System.out.println(ans);
}
public static void dfs(boolean[][] visited, String[] map, String key, int h, int w) {
visited[h][w] = true;
int di[] = {0, 0, -1, +1};
int dj[] = {+1, -1, 0, 0};
for(int i=0;i<4;i++) {
int ni = h + di[i];
int nj = w + dj[i];
if(visited[ni][nj] == false && (""+map[ni].charAt(nj)).equals(key)) {
dfs(visited, map, key, ni, nj);
}
}
}
} | Main.java:12: error: incompatible types: unexpected return value
if(H == 0 && W == 0) return 0;
^
Main.java:30: error: incompatible types: unexpected return value
return 0;
^
2 errors
|
s841961851 | p00118 | Java | import java.io.IOException;
import java.lang.reflect.Array;
import java.util.*;
class Main {
public static int main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
while(true) {
int H = in.nextInt();
int W = in.nextInt();
if(H == 0 && W == 0) return 0;
in.nextLine();
String[] map = new String[H + 200];
String str = "";
for (int i = 0; i < W + 2; i++) {
str += ".";
}
map[0] = str;
for (int i = 1; i <= H; i++) {
String s = in.nextLine();
map[i] = "." + s + ".";
}
map[H + 1] = str;
solve(H, W, map);
}
return 0;
}
public static void print(String[] map, int H, int W) {
for(int i=0;i<H+2;i++) {
for(int j=0;j<W+2;j++) {
System.out.print(map[i].charAt(j));
}
System.out.println("");
}
}
public static void solve(int H, int W, String[] map) {
// print(map, H, W);
boolean visited[][] = new boolean[H+200][W+200];
int ans = 0;
for(int i=1;i<=H;i++) {
for(int j=1;j<=W;j++) {
if(!visited[i][j]) {
dfs(visited, map, ""+map[i].charAt(j), i, j);
ans++;
}
}
}
System.out.println(ans);
}
public static void dfs(boolean[][] visited, String[] map, String key, int h, int w) {
visited[h][w] = true;
int di[] = {0, 0, -1, +1};
int dj[] = {+1, -1, 0, 0};
for(int i=0;i<4;i++) {
int ni = h + di[i];
int nj = w + dj[i];
if(visited[ni][nj] == false && (""+map[ni].charAt(nj)).equals(key)) {
dfs(visited, map, key, ni, nj);
}
}
}
} | Main.java:30: error: unreachable statement
return 0;
^
1 error
|
s014089656 | p00118 | Java | import java.util.Scanner;
public class a0118 {
private static char[][] chars;
private static int row, col;
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
char symbol;
while (true) {
row = input.nextInt();
col = input.nextInt();
if (row == 0 && col == 0) {
break;
}
chars = new char[row][col];
for (int i = 0; i < row; i++) {
chars[i] = input.next().toCharArray();
}
int n = 0;
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
symbol = chars[i][j];
if (symbol != '.') {
dfs(i, j, symbol);
n++;
}
}
}
System.out.println(n);
}
}
private static void dfs(int x, int y, char symbol) {
chars[x][y] = '.';
int dx, dy;
int[] x_mov = {-1, 0, 0, 1}, y_mov = {0, -1, 1, 0};
for (int i = 0; i < x_mov.length; i++) {
dx = x + x_mov[i]; dy = y + y_mov[i];
if (0 <= dx && dx < row && 0 <= dy && dy < col &&
chars[dx][dy] == symbol) {
dfs(dx, dy, symbol);
}
}
}
} | Main.java:3: error: class a0118 is public, should be declared in a file named a0118.java
public class a0118 {
^
1 error
|
s229317271 | p00118 | Java | import java.util.Scanner;
??
public class Main {
????????static char[][] chars;
????????static int row, col;
????????public static void main(String[] args) {
????????????????Scanner input = new Scanner(System.in);
????????????????while (true) {
????????????????????????row = input.nextInt();
????????????????????????col = input.nextInt();
????????????????????????if (row == 0 && col == 0) {
????????????????????????????????break;
????????????????????????}
????????????????????????chars = new char[row][];
????????????????????????for (int i = 0; i < row; i++) {
????????????????????????????????chars[i] = input.next().toCharArray();
????????????????????????}
????????????????????????int n = 0;
????????????????????????for (int i = 0; i < row; i++) {
????????????????????????????????for (int j = 0; j < col; j++) {
????????????????????????????????????????char symbol = chars[i][j];
????????????????????????????????????????if (symbol != '.') {
????????????????????????????????????????????????dfs(i, j, symbol);
????????????????????????????????????????????????n++;
????????????????????????????????????????}
????????????????????????????????}
????????????????????????}
????????????????????????System.out.println(n);
????????????????}
????????}
????????private static void dfs(int x, int y, char symbol) {
????????????????int dx, dy;
????????????????int[] x_mov = {-1, 0, 0, 1}, y_mov = {0, -1, 1, 0};
????????????????for (int i = 0; i < x_mov.length; i++) {
????????????????????????dx = x + x_mov[i]; dy = y + y_mov[i];
????????????????????????if (0 <= dx && dx < row && 0 <= dy && dy < col &&
????????????????????????????????????????chars[dx][dy] == symbol) {
chars[dx][dy] = '.';
????????????????????????????????dfs(dx, dy, symbol);
????????????????????????}
????????????????}
????????}
} | Main.java:2: error: class, interface, enum, or record expected
??
^
Main.java:4: error: illegal start of type
????????static char[][] chars;
^
Main.java:5: error: illegal start of type
????????static int row, col;
^
Main.java:6: error: illegal start of type
????????public static void main(String[] args) {
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: illegal start of expression
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: : expected
????????????????Scanner input = new Scanner(System.in);
^
Main.java:7: error: : expected
????????????????Scanner input = new Scanner(System.in);
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:8: error: illegal start of expression
????????????????while (true) {
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: illegal start of expression
????????????????????????row = input.nextInt();
^
Main.java:9: error: : expected
????????????????????????row = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: illegal start of expression
????????????????????????col = input.nextInt();
^
Main.java:10: error: : expected
????????????????????????col = input.nextInt();
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: error: illegal start of expression
????????????????????????if (row == 0 && col == 0) {
^
Main.java:11: |
s893367341 | p00118 | Java | import java.util.*;
import java.io.*;
public class Main {
static IO io = new IO();
static char map[][];
static int dx[] = {0, 1, 0, -1};
static int dy[] = {1, 0, -1, 0};
static int ys;
static int xs;
public static void main(String[] args) {
while (true) {
ys = io.nextInt();
xs = io.nextInt();
if (ys==0 && xs==0) break;
map = new char[ys][xs];
for (int j=0; j<ys; j++) {
map[j] = io.nextCharArray(xs);
}
int ans = 0;
for (int j=0; j<ys; j++) {
for (int i=0; i<xs; i++) {
if (map[j][i]=='@' || map[j][i]=='#' || map[j][i]=='*') {
dfs(i, j, map[j][i]);
ans++;
}
}
}
System.out.println(ans);
}
}
static void dfs(int x, int y, char c) {
map[y][x] = ' ';
for (int i=0; i<4; i++) {
if (0<=x+dx[i] && x+dx[i]<xs && 0<=y+dy[i] && y+dy[i]<ys) {
if (map[y+dy[i]][x+dx[i]]==c) dfs(x+dx[i], y+dy[i], c);
}
}
} | Main.java:49: error: reached end of file while parsing
}
^
1 error
|
s662291768 | p00118 | Java | import java.util.*;
import java.io.*;
public class Main {
static Scanner sc = new Scanner(System.in);
static char map[][];
static int dx[] = {0, 1, 0, -1};
static int dy[] = {1, 0, -1, 0};
static int ys;
static int xs;
public static void main(String[] args) {
while (true) {
ys = sc.nextInt();
xs = sc.nextInt();
if (ys==0 && xs==0) break;
map = new char[ys][xs];
for (int j=0; j<ys; j++) {
map[j] = sc.nextCharArray(xs);
}
int ans = 0;
for (int j=0; j<ys; j++) {
for (int i=0; i<xs; i++) {
if (map[j][i]=='@' || map[j][i]=='#' || map[j][i]=='*') {
dfs(i, j, map[j][i]);
ans++;
}
}
}
System.out.println(ans);
}
}
static void dfs(int x, int y, char c) {
map[y][x] = ' ';
for (int i=0; i<4; i++) {
if (0<=x+dx[i] && x+dx[i]<xs && 0<=y+dy[i] && y+dy[i]<ys) {
if (map[y+dy[i]][x+dx[i]]==c) dfs(x+dx[i], y+dy[i], c);
}
}
} | Main.java:49: error: reached end of file while parsing
}
^
1 error
|
s024048223 | p00118 | Java |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static char map[][];
static int dx[] = {0, 1, 0, -1};
static int dy[] = {1, 0, -1, 0};
static int ys;
static int xs;
public static void main(String[] args) {
while (true) {
ys = sc.nextInt();
xs = sc.nextInt();
if (ys==0 && xs==0) break;
map = new char[ys][xs];
for (int j=0; j<ys; j++) {
map[j] = sc.nextCharArray(xs);
}
int ans = 0;
for (int j=0; j<ys; j++) {
for (int i=0; i<xs; i++) {
if (map[j][i]=='@' || map[j][i]=='#' || map[j][i]=='*') {
dfs(i, j, map[j][i]);
ans++;
}
}
}
System.out.println(ans);
}
}
static void dfs(int x, int y, char c) {
map[y][x] = ' ';
for (int i=0; i<4; i++) {
if (0<=x+dx[i] && x+dx[i]<xs && 0<=y+dy[i] && y+dy[i]<ys) {
if (map[y+dy[i]][x+dx[i]]==c) dfs(x+dx[i], y+dy[i], c);
}
}
} | Main.java:49: error: reached end of file while parsing
}
^
1 error
|
s227874918 | p00118 | Java | import java.util.Scanner;
/**
* Created by The Illsionist on 2018/1/6.
*/
public class AOJ0118 {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
int result = 0;
while(true){
int W = input.nextInt(); // W columns
int H = input.nextInt(); // H rows
if(W == 0 && H == 0){
break; //stop condition
}
char[][] array = new char[H][W];
for(int i = 0;i < H;i++){
array[i] = input.next().toCharArray();
}
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
char fruit = array[i][j];
if(fruit == '@' || fruit == '#' || fruit == '*'){
result++;
dfs(array,i,j,fruit);
}
}
}
System.out.println(result);
result = 0;
}
input.close();
}
public static void dfs(char[][] array,int x,int y,char fruit){
array[x][y] = '!';
int[] dx = new int[]{-1,0,1,0};
int[] dy = new int[]{0,-1,0,1};
for(int i = 0;i < 4;i++){
int tx = x + dx[i];
int ty = y + dy[i];
if(tx >= 0 && tx < array.length && ty >= 0 && ty < array[0].length && array[tx][ty] == fruit)
dfs(array,tx,ty,fruit);
}
}
}
| Main.java:6: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s961072535 | p00118 | Java | import java.util.Scanner;
/**
* Created by The Illsionist on 2018/1/6.
*/
public class AOJ0118 {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
int result = 0;
while(true){
int W = input.nextInt(); // W columns
int H = input.nextInt(); // H rows
if(W == 0 && H == 0){
break; //stop condition
}
char[][] array = new char[H][W];
for(int i = 0;i < H;i++){
array[i] = input.next().toCharArray();
}
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
char fruit = array[i][j];
if(fruit == '@' || fruit == '#' || fruit == '*'){
result++;
dfs(array,i,j,fruit);
}
}
}
System.out.println(result);
result = 0;
}
input.close();
}
public static void dfs(char[][] array,int x,int y,char fruit){
array[x][y] = '!';
int[] dx = new int[]{-1,0,1,0};
int[] dy = new int[]{0,-1,0,1};
for(int i = 0;i < 4;i++){
int tx = x + dx[i];
int ty = y + dy[i];
if(tx >= 0 && tx < array.length && ty >= 0 && ty < array[0].length && array[tx][ty] == fruit)
dfs(array,tx,ty,fruit);
}
}
}
| Main.java:6: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118 {
^
1 error
|
s628421626 | p00118 | Java | class AOJ0118 {
public static void main(String args[]){
Scanner input = new Scanner(System.in);
int result = 0;
while(true){
int W = input.nextInt();
int H = input.nextInt();
if(W < 0 || H < 0 || (W <= 0 && H <= 0))
break;
char[][] array = new char[H][W];
for(int i = 0;i < H;i++){
array[i] = input.next().toCharArray();
}
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
char fruit = array[i][j];
if(fruit == '@' || fruit == '#' || fruit == '*'){
result++;
dfs(array,i,j,fruit);
}
}
}
System.out.println(result);
result = 0;
}
}
public static void dfs(char[][] array,int x,int y,char fruit){
array[x][y] = '!';
int[] dx = new int[]{-1,0,1,0};
int[] dy = new int[]{0,-1,0,1};
for(int i = 0;i < 4;i++){
int tx = x + dx[i];
int ty = y + dy[i];
if(tx >= 0 && tx < array.length && ty >= 0 && ty < array[0].length && array[tx][ty] == fruit)
dfs(array,tx,ty,fruit);
}
}
}
| Main.java:3: error: cannot find symbol
Scanner input = new Scanner(System.in);
^
symbol: class Scanner
location: class AOJ0118
Main.java:3: error: cannot find symbol
Scanner input = new Scanner(System.in);
^
symbol: class Scanner
location: class AOJ0118
2 errors
|
s941723074 | p00118 | Java | public class Main {
public static int[] dx = {-1, 0, 1, 0};
public static int[] dy = {0, -1, 0, 1};
public static void dfs(int x, int y, char[][] region, int n, int m)
{
char c = region[x][y];
region[x][y] = 'x';
for(int i=0;i<4;i++)
{
int new_x = x + dx[i];
int new_y = y + dy[i];
if(new_x >= 0 && new_x < n && new_y >= 0 && new_y < m && region[new_x][new_y] == c)
{
dfs(new_x, new_y, region,n, m);
}
}
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
while(true)
{
int m = sc.nextInt();
int n = sc.nextInt();
String temp = sc.nextLine();
if(m==0&&n==0)
{
break;
}
// System.out.println(m+" "+n);
char[][] region = new char[m][n];
for(int i=0;i<m;i++)
{
// System.out.println(i);
String line = sc.nextLine();
// System.out.println(line);
for(int j=0;j<n;j++)
{
region[i][j] = line.charAt(j);
}
}
int res = 0;
for(int i=0;i<m;i++)
{
for(int j=0; j<n;j++)
{
if(region[i][j] == 'x')
continue;
else
{
res += 1;
dfs(i,j, region, n, m);
}
}
}
System.out.println(res);
}
}
}
| Main.java:23: error: cannot find symbol
Scanner sc = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
Main.java:23: error: cannot find symbol
Scanner sc = new Scanner(System.in);
^
symbol: class Scanner
location: class Main
2 errors
|
s576252747 | p00118 | Java | import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]){
try{
new Main();
}catch(IOException err){
err.printStackTrace();
}
}
public Main() throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
List<Integer> Ans = new ArrayList<Integer>();
String line;
while((line = in.readLine()) != null){
String[] dst = line.split(" ");
int h = Integer.parseInt(dst[0]);
int w = Integer.parseInt(dst[1]);
if(h==0 && w==0){
break;
}
String[][] data = new String[h+1][w+1];
for(int j=1; j<=h; j++){
line = in.readLine();
for(int i=1; i<=w; i++){
data[j][i] = line.substring(i-1, i);
}
}
for(int j=0; j<=h; j++){
data[j][0] = " ";
}
for(int i=0; i<=w; i++){
data[0][i] = " ";
}
int count = 0;
String prev = "";
for(int j=1; j<=h; j++){
for(int i=1; i<=w; i++){
if(!data[j][i].equals(prev)){
prev = "";
}
if(!data[j][i].equals(data[j-1][i]) && !data[j][i].equals(data[j][i-1])){
count++;
}
else if(data[j][i].equals(data[j-1][i]) && data[j][i].equals(data[j][i-1]) && !data[j][i].equals(data[j-1][i-1])){
if(prev.equals("")){
count--;
}
}
else if(data[j][i].equals(data[j-1][i])){
prev = data[j][i];
}
}
}
Ans.add(count);
}
for(int n=0; n<Ans.size(); n++){
System.out.println(Ans.get(n));
}
}
}import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]){
try{
new Main();
}catch(IOException err){
err.printStackTrace();
}
}
public Main() throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
List<Integer> Ans = new ArrayList<Integer>();
String line;
while((line = in.readLine()) != null){
String[] dst = line.split(" ");
int h = Integer.parseInt(dst[0]);
int w = Integer.parseInt(dst[1]);
if(h==0 && w==0){
break;
}
String[][] data = new String[h+1][w+1];
for(int j=1; j<=h; j++){
line = in.readLine();
for(int i=1; i<=w; i++){
data[j][i] = line.substring(i-1, i);
}
}
for(int j=0; j<=h; j++){
data[j][0] = " ";
}
for(int i=0; i<=w; i++){
data[0][i] = " ";
}
int count = 0;
String prev = "";
for(int j=1; j<=h; j++){
for(int i=1; i<=w; i++){
if(!data[j][i].equals(prev)){
prev = "";
}
if(!data[j][i].equals(data[j-1][i]) && !data[j][i].equals(data[j][i-1])){
count++;
}
else if(data[j][i].equals(data[j-1][i]) && data[j][i].equals(data[j][i-1]) && !data[j][i].equals(data[j-1][i-1])){
if(prev.equals("")){
count--;
}
}
else if(data[j][i].equals(data[j-1][i])){
prev = data[j][i];
}
}
}
Ans.add(count);
}
for(int n=0; n<Ans.size(); n++){
System.out.println(Ans.get(n));
}
}
} | Main.java:74: error: class, interface, enum, or record expected
}import java.io.*;
^
Main.java:75: error: class, interface, enum, or record expected
import java.util.*;
^
2 errors
|
s222567594 | p00118 | Java | import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]){
try{
new Main();
}catch(IOException err){
err.printStackTrace();
}
}
int[][] offset = new int[][]{
{-1, 0}, {1, 0}, {0, -1}, {0, 1}
};
public Main() throws IOException, StackOverflowError{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
List<Integer> Ans = new ArrayList<Integer>();
String line;
while((line = in.readLine()) != null){
String[] dst = line.split(" ");
int h = Integer.parseInt(dst[0]);
int w = Integer.parseInt(dst[1]);
if(h==0 && w==0){
break;
}
int[][] data = new int[h+2][w+2];
int[][] label = new int[h+2][w+2];
for(int j=1; j<=h; j++){
line = in.readLine();
for(int i=1; i<=w; i++){
String c = line.substring(i-1, i);
if(c.equals("@")){
data[j][i] = 1;
}
else if(c.equals("#")){
data[j][i] = 2;
}
else if(c.equals("*")){
data[j][i] = 3;
}
label[j][i] = 0;
}
}
for(int j=0; j<h+2; j++){
data[j][0] = 0;
data[j][h+1] = 0;
label[j][0] = -1;
label[j][h+1] = -1;
}
for(int i=0; i<w+2; i++){
data[0][i] = 0;
data[w+1][i] = 0;
label[0][i] = -1;
label[w+1][i] = -1;
}
int count = 0;
for(int j=1; j<=h; j++){
for(int i=1; i<=w; i++){
if(label[j][i] == 0){
count++;
label[j][i] = count;
grouping(data, label, i, j);
}
}
}
Ans.add(count);
}
for(int n=0; n<Ans.size(); n++){
System.out.println(Ans.get(n));
}
}
public void grouping(int[][] data, int[][] label, int x, int y){
List<point> cue = new ArrayList<point>();
cue.add(new point(x, y));
while(cue.size() != 0){
point p = cue.get(0);
cue.remove(0);
for(int d=0; d<4; d++){
int xx = p.x + offset[d][0];
int yy = p.y + offset[d][1];
if(label[yy][xx] == 0 && data[yy][xx] == data[p.y][p.x]){
label[yy][xx] = label[p.y][p.x];
cue.add(new point(xx, yy));
}
}
}
}
}
class point{
int x;
int y;
public point(int x, int y){
this.x = x;
this.y = y;
}
}import java.io.*;
import java.util.*;
public class Main{
public static void main(String args[]){
try{
new Main();
}catch(IOException err){
err.printStackTrace();
}
}
int[][] offset = new int[][]{
{-1, 0}, {1, 0}, {0, -1}, {0, 1}
};
public Main() throws IOException, StackOverflowError{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
List<Integer> Ans = new ArrayList<Integer>();
String line;
while((line = in.readLine()) != null){
String[] dst = line.split(" ");
int h = Integer.parseInt(dst[0]);
int w = Integer.parseInt(dst[1]);
if(h==0 && w==0){
break;
}
int[][] data = new int[h+2][w+2];
int[][] label = new int[h+2][w+2];
for(int j=1; j<=h; j++){
line = in.readLine();
for(int i=1; i<=w; i++){
String c = line.substring(i-1, i);
if(c.equals("@")){
data[j][i] = 1;
}
else if(c.equals("#")){
data[j][i] = 2;
}
else if(c.equals("*")){
data[j][i] = 3;
}
label[j][i] = 0;
}
}
for(int j=0; j<h+2; j++){
data[j][0] = 0;
data[j][h+1] = 0;
label[j][0] = -1;
label[j][h+1] = -1;
}
for(int i=0; i<w+2; i++){
data[0][i] = 0;
data[w+1][i] = 0;
label[0][i] = -1;
label[w+1][i] = -1;
}
int count = 0;
for(int j=1; j<=h; j++){
for(int i=1; i<=w; i++){
if(label[j][i] == 0){
count++;
label[j][i] = count;
grouping(data, label, i, j);
}
}
}
Ans.add(count);
}
for(int n=0; n<Ans.size(); n++){
System.out.println(Ans.get(n));
}
}
public void grouping(int[][] data, int[][] label, int x, int y){
List<point> cue = new ArrayList<point>();
cue.add(new point(x, y));
while(cue.size() != 0){
point p = cue.get(0);
cue.remove(0);
for(int d=0; d<4; d++){
int xx = p.x + offset[d][0];
int yy = p.y + offset[d][1];
if(label[yy][xx] == 0 && data[yy][xx] == data[p.y][p.x]){
label[yy][xx] = label[p.y][p.x];
cue.add(new point(xx, yy));
}
}
}
}
}
class point{
int x;
int y;
public point(int x, int y){
this.x = x;
this.y = y;
}
} | Main.java:111: error: class, interface, enum, or record expected
}import java.io.*;
^
Main.java:112: error: class, interface, enum, or record expected
import java.util.*;
^
2 errors
|
s275230299 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = nextByte();
}
skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
char [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx;
int ny = x + dx^1;
if(0<=nx
&& nx < N
&&0<=ny
&&ny <M
&& field[ny][nx].equals(crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:16: error: cannot find symbol
field[i][j] = nextByte();
^
symbol: method nextByte()
location: class Main
Main.java:18: error: cannot find symbol
skip("\n");
^
symbol: method skip(String)
location: class Main
Main.java:37: error: incompatible types: possible lossy conversion from int to char
char [] dx= {1,0,-1,0};
^
Main.java:40: error: bad operand types for binary operator '+'
int nx = x+dx;
^
first type: int
second type: char[]
Main.java:41: error: bad operand types for binary operator '+'
int ny = x + dx^1;
^
first type: int
second type: char[]
Main.java:43: error: cannot find symbol
&& nx < N
^
symbol: variable N
location: class Main
Main.java:45: error: cannot find symbol
&&ny <M
^
symbol: variable M
location: class Main
Main.java:46: error: char cannot be dereferenced
&& field[ny][nx].equals(crop)){
^
8 errors
|
s986702476 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = scan.nextByte();
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx;
int ny = x + dx^1;
if(0<=nx
&& nx < N
&&0<=ny
&&ny <M
&& field[ny][nx].equals(crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:16: error: incompatible types: possible lossy conversion from byte to char
field[i][j] = scan.nextByte();
^
Main.java:40: error: bad operand types for binary operator '+'
int nx = x+dx;
^
first type: int
second type: int[]
Main.java:41: error: bad operand types for binary operator '+'
int ny = x + dx^1;
^
first type: int
second type: int[]
Main.java:43: error: cannot find symbol
&& nx < N
^
symbol: variable N
location: class Main
Main.java:45: error: cannot find symbol
&&ny <M
^
symbol: variable M
location: class Main
Main.java:46: error: char cannot be dereferenced
&& field[ny][nx].equals(crop)){
^
6 errors
|
s085442658 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = scan.nextByte();
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx;
int ny = x + dx^1;
if(0<=nx
&& nx < N
&&0<=ny
&&ny <M
&& field[ny][nx].equals(crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:10: error: variable M is already defined in method main(String[])
int M = scan.nextInt();
^
Main.java:17: error: incompatible types: possible lossy conversion from byte to char
field[i][j] = scan.nextByte();
^
Main.java:41: error: bad operand types for binary operator '+'
int nx = x+dx;
^
first type: int
second type: int[]
Main.java:42: error: bad operand types for binary operator '+'
int ny = x + dx^1;
^
first type: int
second type: int[]
Main.java:44: error: cannot find symbol
&& nx < N
^
symbol: variable N
location: class Main
Main.java:46: error: cannot find symbol
&&ny <M
^
symbol: variable M
location: class Main
Main.java:47: error: char cannot be dereferenced
&& field[ny][nx].equals(crop)){
^
7 errors
|
s982605522 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx;
int ny = x + dx^1;
if(0<=nx
&& nx < N
&&0<=ny
&&ny <M
&& field[ny][nx].equals(crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:10: error: variable M is already defined in method main(String[])
int M = scan.nextInt();
^
Main.java:41: error: bad operand types for binary operator '+'
int nx = x+dx;
^
first type: int
second type: int[]
Main.java:42: error: bad operand types for binary operator '+'
int ny = x + dx^1;
^
first type: int
second type: int[]
Main.java:44: error: cannot find symbol
&& nx < N
^
symbol: variable N
location: class Main
Main.java:46: error: cannot find symbol
&&ny <M
^
symbol: variable M
location: class Main
Main.java:47: error: char cannot be dereferenced
&& field[ny][nx].equals(crop)){
^
6 errors
|
s112151564 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if(0<=nx
&& nx < N
&&0<=ny
&&ny <M
&& field[ny][nx].equals(crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:43: error: cannot find symbol
&& nx < N
^
symbol: variable N
location: class Main
Main.java:45: error: cannot find symbol
&&ny <M
^
symbol: variable M
location: class Main
Main.java:46: error: char cannot be dereferenced
&& field[ny][nx].equals(crop)){
^
3 errors
|
s386245344 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
dfs(ny,nx,field);
}
}
}
} | Main.java:42: error: cannot find symbol
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
symbol: variable N
location: class Main
Main.java:42: error: cannot find symbol
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
symbol: variable M
location: class Main
Main.java:42: error: char cannot be dereferenced
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
3 errors
|
s734110201 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field,M,N);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field,int M,int N){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
dfs(ny,nx,field);
}
}
}
} | Main.java:42: error: char cannot be dereferenced
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
Main.java:43: error: method dfs in class Main cannot be applied to given types;
dfs(ny,nx,field);
^
required: int,int,char[][],int,int
found: int,int,char[][]
reason: actual and formal argument lists differ in length
2 errors
|
s316081272 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field,M,N);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field,int M,int N){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
dfs(ny,nx,field,M,N);
}
}
}
} | Main.java:42: error: char cannot be dereferenced
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
1 error
|
s084994717 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
int M = scan.nextInt();
int N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field,M,N);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field,int M,int N){
String crop = (String)(field[y][x]);
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
dfs(ny,nx,field,M,N);
}
}
}
} | Main.java:35: error: incompatible types: char cannot be converted to String
String crop = (String)(field[y][x]);
^
Main.java:42: error: char cannot be dereferenced
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx].equals(crop))){
^
2 errors
|
s382953213 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public int M;
public int N;
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
while(true){
M = scan.nextInt();
N = scan.nextInt();
if(N==0 && M ==0)break;
int ans =0;
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
field[i][j] = (char)(scan.nextInt());
}
scan.skip("\n");
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
dfs(i,j,field);
ans++;
}
}
}
System.out.println(ans);
}
}
public static void dfs(int x,int y,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
int [] dx= {1,0,-1,0};
for(int i=0;i<3;i++){
int nx = x+dx[i];
int ny = y + dx[i]^1;
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx]==crop)){
dfs(ny,nx,field);
}
}
}
} | Main.java:11: error: non-static variable M cannot be referenced from a static context
M = scan.nextInt();
^
Main.java:12: error: non-static variable N cannot be referenced from a static context
N = scan.nextInt();
^
Main.java:13: error: non-static variable N cannot be referenced from a static context
if(N==0 && M ==0)break;
^
Main.java:13: error: non-static variable M cannot be referenced from a static context
if(N==0 && M ==0)break;
^
Main.java:15: error: non-static variable M cannot be referenced from a static context
char [][] field =new char[M][N];
^
Main.java:15: error: non-static variable N cannot be referenced from a static context
char [][] field =new char[M][N];
^
Main.java:16: error: non-static variable M cannot be referenced from a static context
for(int i=0;i<M;i++){
^
Main.java:17: error: non-static variable N cannot be referenced from a static context
for(int j=0;j<N;j++){
^
Main.java:23: error: non-static variable M cannot be referenced from a static context
for(int i=0;i<M;i++){
^
Main.java:24: error: non-static variable N cannot be referenced from a static context
for(int j=0;j<N;j++){
^
Main.java:44: error: non-static variable N cannot be referenced from a static context
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx]==crop)){
^
Main.java:44: error: non-static variable M cannot be referenced from a static context
if((0<=nx )&& (nx < N) &&(0<=ny )&& (ny <M) &&( field[ny][nx]==crop)){
^
12 errors
|
s923174626 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static int M;
public static int N;
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
Boolean flag = true;
while(flag){
M = scan.nextInt();
N = scan.nextInt();
// System.out.println(M);System.out.println(N);
if(N ==0 && M ==0){break;}
int ans =0;
if(M==1&&N==0){System.out.println(ans);continue;}
scan.nextLine();
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
String line = scan.nextLine();
for(int j=0;j<N;j++){
field[i][j] = line.charAt(j);
}
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
++ans;
dfs(i,j,field);
}
}
}
System.out.println(ans);
} | Main.java:42: error: reached end of file while parsing
}
^
1 error
|
s109661483 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static int M;
public static int N;
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
Boolean flag = true;
while(flag){
M = scan.nextInt();
N = scan.nextInt();
// System.out.println(M);System.out.println(N);
if(N ==0 && M ==0){break;}
int ans =0;
if(M==1&&N==0){System.out.println(ans);continue;}
scan.nextLine();
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
String line = scan.nextLine();
for(int j=0;j<N;j++){
field[i][j] = line.charAt(j);
}
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
++ans;
dfs(i,j,field);
}
}
}
System.out.println(ans);
}
}
public static void dfs(byte y,byte x,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
byte [] dx= {1,0,-1,0};
for(byte i=0;i<4;i++){
if(0<=x|dx[i] && x | dx[i] < N &&0<=(y | (dx[i]^1)) && (y | (dx[i]^1)) <M &&( field[y+dx[i]^1][x | dx[i]]==crop))
dfs(y | dx[i],x| (dx[i]^1),field);
}
return;
}
} | Main.java:35: error: incompatible types: possible lossy conversion from int to byte
dfs(i,j,field);
^
Main.java:52: error: bad operand types for binary operator '|'
if(0<=x|dx[i] && x | dx[i] < N &&0<=(y | (dx[i]^1)) && (y | (dx[i]^1)) <M &&( field[y+dx[i]^1][x | dx[i]]==crop))
^
first type: boolean
second type: byte
Main.java:52: error: bad operand types for binary operator '|'
if(0<=x|dx[i] && x | dx[i] < N &&0<=(y | (dx[i]^1)) && (y | (dx[i]^1)) <M &&( field[y+dx[i]^1][x | dx[i]]==crop))
^
first type: byte
second type: boolean
Main.java:53: error: incompatible types: possible lossy conversion from int to byte
dfs(y | dx[i],x| (dx[i]^1),field);
^
Note: Some messages have been simplified; recompile with -Xdiags:verbose to get full output
4 errors
|
s808476113 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static int M;
public static int N;
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
Boolean flag = true;
while(flag){
M = scan.nextInt();
N = scan.nextInt();
// System.out.println(M);System.out.println(N);
if(N ==0 && M ==0){break;}
int ans =0;
if(M==1&&N==0){System.out.println(ans);continue;}
scan.nextLine();
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
String line = scan.nextLine();
for(int j=0;j<N;j++){
field[i][j] = line.charAt(j);
}
}
for(int i=0;i<M;i++){
for(int j=0;j<N;j++){
if(field[i][j] != '.'){
++ans;
dfs(i,j,field);
}
}
}
System.out.println(ans);
}
}
public static void dfs(byte y,byte x,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
byte [] dx= {1,0,-1,0};
for(byte i=0;i<4;i++){
if((0<=(x|dx[i])) && (x | dx[i]) < N &&0<=(y | (dx[i]^1)) && (y | (dx[i]^1)) <M &&( field[y+(dx[i]^1)][x | dx[i]]==crop))
dfs(y | (dx[i]^1),x| dx[i],field);
}
return;
}
} | Main.java:35: error: incompatible types: possible lossy conversion from int to byte
dfs(i,j,field);
^
Main.java:53: error: incompatible types: possible lossy conversion from int to byte
dfs(y | (dx[i]^1),x| dx[i],field);
^
Note: Some messages have been simplified; recompile with -Xdiags:verbose to get full output
2 errors
|
s309226086 | p00118 | Java | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static int M;
public static int N;
public static void main(String[] args) throws java.io.IOException{
Scanner scan = new Scanner(System.in);
Boolean flag = true;
while(flag){
M = scan.nextInt();
N = scan.nextInt();
// System.out.println(M);System.out.println(N);
if(N ==0 && M ==0){break;}
int ans =0;
if(M==1&&N==0){System.out.println(ans);continue;}
scan.nextLine();
char [][] field =new char[M][N];
for(int i=0;i<M;i++){
String line = scan.nextLine();
for(int j=0;j<N;j++){
field[i][j] = line.charAt(j);
}
}
for(byte i=0;i<M;i++){
for(byte j=0;j<N;j++){
if(field[i][j] != '.'){
++ans;
dfs(i,j,field);
}
}
}
System.out.println(ans);
}
}
public static void dfs(byte y,byte x,char [][] field){
char crop = field[y][x];
field[y][x] = '.';
byte [] dx= {1,0,-1,0};
for(byte i=0;i<4;i++){
if((0<=(x|dx[i])) && (x | dx[i]) < N &&0<=(y | (dx[i]^1)) && (y | (dx[i]^1)) <M &&( field[y+(dx[i]^1)][x | dx[i]]==crop))
dfs(y | (dx[i]^1),x| dx[i],field);
}
return;
}
} | Main.java:53: error: incompatible types: possible lossy conversion from int to byte
dfs(y | (dx[i]^1),x| dx[i],field);
^
Note: Some messages have been simplified; recompile with -Xdiags:verbose to get full output
1 error
|
s751142815 | p00118 | Java | import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main2 {
static int h, w;
static int[][] field;
static int[] v1 = { 0, 1, 0, -1 };
static int[] v2 = { 1, 0, -1, 0 };
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (true) {
h = cin.nextInt();
w = cin.nextInt();
if (h + w == 0) {
break;
}
field = new int[h + 2][w + 2];
for (int i = 0; i < h; i++) {
String str = cin.next();
for (int j = 0; j < str.length(); j++) {
if (str.charAt(j) == '#') {
field[i + 1][j + 1] = 1;
} else if (str.charAt(j) == '@') {
field[i + 1][j + 1] = 2;
} else {
field[i + 1][j + 1] = 3;
}
}
}
int count=0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if (field[i][j] == 0) {
continue;
} else {
count++;
Queue<Integer[]> que = new LinkedList<Integer[]>();
Integer[] a = { i, j };
que.add(a);
int value = field[i][j];
while (!que.isEmpty()) {
Integer[] c = que.poll();
field[c[0]][c[1]]=0;
for(int k = 0;k<4;k++){
int xx=c[0]+v1[k];
int yy=c[1]+v2[k];
if(field[xx][yy]==value){
Integer[] d = {xx,yy};
que.add(d);
}
}
}
}
}
}
System.out.println(count);
}
}
} | Main.java:5: error: class Main2 is public, should be declared in a file named Main2.java
public class Main2 {
^
1 error
|
s363377417 | p00118 | Java | import java.util.*;
public class Main {
int h, w;
int[][] map;
public void loop(int y, int x, int d){
map[y][x] = 0;
if(x!=0 && map[y][x-1]==d) loop(y,x-1,d);
if(y!=0 && map[y-1][x]==d) loop(y-1,x,d);
if(x!=w-1 && map[y][x+1]==d) loop(y,x+1,d);
if(y!=h-1 && map[y+1][x]==d) loop(y+1,x,d);
}
public void func(){
int count = 0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(map[i][j]!=0){
count++;
loop(i, j, map[i][j]);
}
}
}
System.out.println(count);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(true){
AOJ_0118 A = new AOJ_0118();
A.h = sc.nextInt();
A.w = sc.nextInt();
if(A.h==0 && A.w==0) break;
A.map = new int[A.h][A.w];
String s = "";
for(int i=0;i<A.h;i++){
s = sc.next();
for(int j=0;j<A.w;j++){
if(s.codePointAt(j)==64) A.map[i][j] = 1;
else if(s.codePointAt(j)==35) A.map[i][j] = 2;
else if(s.codePointAt(j)==42) A.map[i][j] = 3;
}
}
A.func();
}
}
} | Main.java:33: error: cannot find symbol
AOJ_0118 A = new AOJ_0118();
^
symbol: class AOJ_0118
location: class Main
Main.java:33: error: cannot find symbol
AOJ_0118 A = new AOJ_0118();
^
symbol: class AOJ_0118
location: class Main
2 errors
|
s716358164 | p00118 | Java | import java.util.*;
public class AOJ0118{
static Scanner sc = new Scanner(System.in);
static char [][] map;
static boolean [][] mapSearched;
static int [] dx = {0, -1, 0, 1}, dy = {1, 0, -1, 0};
static int H;
static int W;
static int ans;
public static void main(String [] args){
while(solve()){
System.out.println(ans);
}
}
static boolean solve(){
H = sc.nextInt();
W = sc.nextInt();
if(H == 0 && W == 0)return false;
readMap();
createMapSearched();
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
dfs(j, i, 0);
}
}
return true;
}
static void dfs(int x, int y, int node){
if(mapSearched[y][x] == true) return;
mapSearched[y][x] = true;
for(int i = 0; i < dx.length ; i++){
if(check(x + dx[i], y + dy[i])){
if(map[y + dy[i]][x + dx[i]] == map[y][x]){
dfs(x + dx[i], y + dy[i], node + 1);
}
}
}
if(node == 0){
ans++;
}
return;
}
static boolean check(int x, int y){
if(x < 0 || W <= x || y < 0 || H <= y) return false;
else return true;
}
static void readMap(){
map = new char[H][W];
for(int i = 0; i < H; i++){
map[i] = sc.next().toCharArray();
}
return;
}
static void createMapSearched(){
mapSearched = new boolean[H][W];
for(int i = 0; i < H; i++){
Arrays.fill(mapSearched[i], false);
}
}
} | Main.java:2: error: class AOJ0118 is public, should be declared in a file named AOJ0118.java
public class AOJ0118{
^
1 error
|
s608839703 | p00118 | Java | import java.util.*;
public class Main
static Scanner sc = new Scanner(System.in);
static char [][] map;
static char tmp_fruit;
static int [] dx = {0, -1, 0, 1}, dy = {1, 0, -1, 0};
static int H;
static int W;
static int ans;
public static void main(String [] args){
while(solve()){
System.out.println(ans);
}
}
static boolean solve(){
H = sc.nextInt();
W = sc.nextInt();
if(H == 0 && W == 0)return false;
readMap();
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
dfs(j, i, 0);
}
}
return true;
}
static void dfs(int x, int y, int node){
if(map[y][x] == '.') return;
tmp_fruit = map[y][x];
map[y][x] = '.';
for(int i = 0; i < dx.length ; i++){
if(check(x + dx[i], y + dy[i])){
if(map[y + dy[i]][x + dx[i]] == tmp_fruit){
dfs(x + dx[i], y + dy[i], node + 1);
}
}
}
if(node == 0){
ans++;
}
return;
}
static boolean check(int x, int y){
if(x < 0 || W <= x || y < 0 || H <= y) return false;
else return true;
}
static void readMap(){
map = new char[H][W];
for(int i = 0; i < H; i++){
map[i] = sc.next().toCharArray();
}
return;
}
} | Main.java:2: error: '{' expected
public class Main
^
Main.java:4: error: unnamed classes are a preview feature and are disabled by default.
static char [][] map;
^
(use --enable-preview to enable unnamed classes)
Main.java:59: error: class, interface, enum, or record expected
}
^
3 errors
|
s243666273 | p00118 | Java | import java.util.*;
public class Main
static Scanner sc = new Scanner(System.in);
static char [][] map;
static char ch;
static int tmp_x, tmp_y;
static int [] dx = {0, -1, 0, 1}, dy = {1, 0, -1, 0};
static int H;
static int W;
static int ans;
public static void main(String [] args){
while(solve()){
System.out.println(ans);
}
}
static boolean solve(){
H = sc.nextInt();
W = sc.nextInt();
if(H == 0 && W == 0)return false;
readMap();
Deque <Integer> x = new ArrayDeque <Integer>();
Deque <Integer> y = new ArrayDeque <Integer>();
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
if(map[i][j] == '.') continue;
x.push(j);
y.push(i);
while(!x.isEmpty()){
tmp_x = x.pop();
tmp_y = y.pop();
ch = map[tmp_y][tmp_x];
map[tmp_y][tmp_x] = '.';
for(int k = 0; k < dx.length; k++){
if(!check(tmp_x + dx[k], tmp_y + dy[k]))continue;
if(ch == '.') continue;
else if(ch == map[tmp_y + dy[k]][tmp_x + dx[k]]){
x.push(tmp_x + dx[k]);
y.push(tmp_y + dy[k]);
}
}
}
ans++;
}
}
return true;
}
static boolean check(int x, int y){
if(x < 0 || W <= x || y < 0 || H <= y) return false;
else return true;
}
static void readMap(){
map = new char[H][W];
for(int i = 0; i < H; i++){
map[i] = sc.next().toCharArray();
}
return;
}
} | Main.java:2: error: '{' expected
public class Main
^
Main.java:4: error: unnamed classes are a preview feature and are disabled by default.
static char [][] map;
^
(use --enable-preview to enable unnamed classes)
Main.java:6: error: class, interface, enum, or record expected
static int tmp_x, tmp_y;
^
Main.java:62: error: class, interface, enum, or record expected
}
^
4 errors
|
s022040690 | p00118 | Java | import java.util.ArrayDeque;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static final int vx[] = {1,0,-1,0};
public static final int vy[] = {0,-1,0,1};
public static int h = 0;
public static int w = 0;
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
while(true) {
h = sc.nextInt();
w = sc.nextInt();
if (h+w==0) {
break;
}
char[][] f = new char[w][h];
for (int y=0;y<h;y++) {
String line = sc.next();
for(int x=0;x<w;x++) {
f[x][y] = line.charAt(x);
}
}
int ans = 0;
for (int x=0;x<w;x++) {
for (int y=0;y<h;y++) {
if (f[x][y]!='.') {
ans++;
//BFS-------
char tf = f[x][y];
Queue<Pos2d> q = new ArrayDeque<Pos2d>();
q.offer(new Pos2d(x,y));
while(!q.isEmpty()) {
Pos2d p = q.poll();
if (f[p.x][p.y]==tf) {
f[p.x][p.y]='.';
for(int i=0;i<4;i++) {
int nx = p.x + vx[i];
int ny = p.y + vy[i];
if (nx>=0 && nx<w && ny>=0 && ny<h) {
q.offer(new Pos2d(nx,ny));
}
}
}
}
//----------
}
}
}
System.out.println(ans);
}
}
}
public class Pos2d {
public int x = 0;
public int y = 0;
public Pos2d(int x,int y) {
this.x = x;
this.y = y;
}
public boolean equals(Object o) {
Pos2d p = (Pos2d) o;
return (this.x==p.x && this.y==p.y);
}
public String toString() {
return "("+x+","+y+")";
}
} | Main.java:54: error: class Pos2d is public, should be declared in a file named Pos2d.java
public class Pos2d {
^
1 error
|
s871965522 | p00118 | C | #include<stdio.h>
#include<iostream>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int maxn = 102;
const int inf = 0x3f3f3f3f;
char a[maxn][maxn];
int vis[maxn][maxn];
int dre[4][2] = { 0,1,1,0,0,-1,-1,0 };
int n, m;
void init()
{
memset(vis, 0, sizeof(vis));
}
void DFS(int x, int y)
{
vis[x][y] = 1;
for (int i = 0; i < 4; i++)
{
int nx = x + dre[i][0], ny = y + dre[i][1];
//cout << " " << nx << " " << ny << endl;
if (nx >= 0 && nx < n&&ny >= 0 && ny < m && a[nx][ny] == a[x][y] &&!vis[nx][ny])
DFS(nx, ny);
}
return;
}
int main()
{
while (scanf("%d%d", &n, &m), m || m)
{
init();
int ans = 0;
for (int i = 0; i < n; i++)
scanf("%s", &a[i]);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (!vis[i][j])
{
DFS(i,j);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
| main.c:2:9: fatal error: iostream: No such file or directory
2 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s370144786 | p00118 | C | #include<stdio.h>
#include<string.h>
int w,h,sx,sy;
int dx[4]={1,0,-1,0},dy[4] = {0,1,0,-1};
char fruit[100][100];
int flag[100][100];
int num;
void dfs(int x,int y,char c){
flag[x][y] = 1;
for(int i = 0; i < 4;i++){
int nx = x + dx[i], ny = y + dy[i];
if(nx<h&&nx>=0&&ny<w+1&&ny>=0&&!flag[nx][ny])
dfs(nx,ny,fruit[nx][ny]);
}
}
void solve(){
while((~scanf("%d %d",&w,&h))&&w&&h){
num = 0;
memset(flag,0,sizeof(flag));
for(int i = 0; i < h; i++){
for(int j = 0; j < w;j++)
scanf("%c",&fruit[i][j]);
}//for
for(int i = 0; i < h; i++){
for(int j = 0; j < w;j++)
{
if(flag[i][j]==0){
dfs(i,j,fruit[i][j]);
num++;
}
}
printf("%d",num);
}
}
int main(){
solve();
}
| main.c: In function 'solve':
main.c:42:1: error: expected declaration or statement at end of input
42 | }
| ^
|
s817941703 | p00118 | C | #include<stdio.h>
#include<string.h>
int w,h,sx,sy;
int dx[4]={1,0,-1,0},dy[4] = {0,1,0,-1};
char fruit[100][100];
int flag[100][100];
int num;
void dfs(int x,int y,char c){
flag[x][y] = 1;
for(int i = 0; i < 4;i++){
int nx = x + dx[i], ny = y + dy[i];
if(nx<h&&nx>=0&&ny<w+1&&ny>=0&&!flag[nx][ny])
dfs(nx,ny,fruit[nx][ny]);
}
}
void solve(){
while((~scanf("%d %d",&w,&h))&&w&&h){
num = 0;
memset(flag,0,sizeof(flag));
for(int i = 0; i < h; i++){
for(int j = 0; j < w;j++)
scanf("%c",&fruit[i][j]);
}//for
for(int i = 0; i < h; i++){
for(int j = 0; j < w;j++)
{
if(!flag[i][j]){
dfs(i,j,fruit[i][j]);
num++;
}
}
printf("%d",num);
}
return ;
}
int main(){
solve();
return 0 ;
}
| main.c: In function 'solve':
main.c:44:1: error: expected declaration or statement at end of input
44 | }
| ^
|
s671738623 | p00118 | C | //#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
using namespace std;
int h,w,v[100][100];
char c[100][100];
void dfs(int i,int j, char s) {
if(c[i][j]!=s||v[i][j]) return;
v[i][j]=1;
if(i!=0) dfs(i-1,j,s);
if(i!=h-1) dfs(i+1,j,s);
if(j!=0) dfs(i,j-1,s);
if(j!=w-1) dfs(i,j+1,s);
}
int main(){
while(~scanf("%d%d",&h,&w)&&h&&w){
memset(c,0,sizeof(c));
memset(v,0,sizeof(v));
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
scanf(" %c", &c[i][j]);
int cnt =0;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++) {
if(v[i][j]) continue;
dfs(i,j,c[i][j]);
cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
| main.c:2:9: fatal error: cstdio: No such file or directory
2 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s479076304 | p00118 | C | #include<iostream>
#include<string.h>
#include<cmath>
#include<vector>
using namespace std;
char a[101][101];
int h, w;
int f[4][2] = { {0,1},{0,-1},{1,0},{-1,0} };
void dfs(int x,int y,char ch)
{
if (x<0 || x>h - 1 || y<0 || y>w - 1||a[x][y]!=ch) return;
a[x][y] = ' ';
int tx, ty;
for (int i = 0; i <= 3; i++)
{
tx = x + f[i][0];
ty = y + f[i][1];
dfs(tx, ty, ch);
}
}
int main()
{
while (cin >> h >> w)
{
if (!h && !w) break;
for (int i = 0; i < h; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
if (a[i][j] != ' ') {
dfs(i, j, a[i][j]);
sum++;
}
}
}
cout << sum << endl;
}
return 0;
}
| main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s962697988 | p00118 | C | #include<cstdio>
int H, W;
char map[201][201];
int dx[4]{ 0, 0, 1, -1 };
int dy[4]{ 1, -1, 0, 0 };
int ans = 0;
void dfs(int x, int y,char ch)
{
map[x][y] = '.';//把符号@，#，*其中一个替换成.。和poj1979很像，稍微改下1979的代码就行
for (int i = 0; i < 4; i++)
{
int nx = x + dx[i], ny = y + dy[i];
if (0 <= nx&&nx < H && 0 <= ny&&ny < W&&map[nx][ny] ==ch)dfs(nx, ny, ch);
}
}
int main()
{
scanf("%d%d", &H, &W);
while (getchar() != '\n')continue;
while (W&&H)
{
ans = 0;
for (int i = 0; i < H; i++)
gets(map[i]);
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++){
if (map[i][j] == '#'){ dfs(i, j, '#'); ans++; }
else if (map[i][j] == '@'){ dfs(i, j, '@'); ans++; }
else if (map[i][j] == '*'){ dfs(i, j, '*') ; ans++; }
}
}
printf("%d\n", ans);
scanf("%d%d", &H, &W);
while (getchar() != '\n')continue;
}
return 0;
}
| main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s817544195 | p00118 | C | #include <iostream>
#include <cstdio>
#include <cstring>
#define bswap(a,b) a^=b^=a^=b
#define _for(i,a,b) for(int i = (a); i < b; ++i)
#define _rep(i,a,b) for(int i = (a); i <= b; ++i)
#define met(a) memset(a,0,sizeof(a))
#define _met(a) memset(a,-1,sizeof(a))
using namespace std;
const int maxn = 100+5;
char rec[maxn][maxn];
bool visited[maxn][maxn];
int dx[] = {1, 0, 0, -1};
int dy[] = {0, -1, 1, 0};
//pair<int, int> p;
int ans = 0;
int w, h;
void dfs(int x, int y, char c)
{
rec[x][y] = '.';
_for(i,0,4){
int nowx = x + dx[i];
int nowy = y + dy[i];
if(0<=nowx&&nowx<h&&0<=nowy&&nowy<w&&rec[nowx][nowy] == c){
dfs(nowx, nowy, c);
}
}
}
int main()
{
cin>>w>>h;
while (getchar() != '\n') continue;
while(w||h)
{
memset(visited,0,sizeof(visited));
ans = 0;
_for(i,0,h) _for(j,0,w) cin>>rec[i][j];
_for(i,0,h) _for(j,0,w){
if(rec[i][j] == '#'){
ans++;
dfs(i,j,rec[i][j]);
}
else if(rec[i][j] == '@'){
ans++;
dfs(i,j,rec[i][j]);
}
else if(rec[i][j] == '*'){
ans++;
dfs(i,j,rec[i][j]);
}
}
cout<<ans<<endl;
cin>>w>>h;
while (getchar() != '\n')continue;
}
return 0;
}
| main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s603253013 | p00118 | C | #include <iostream>
#include <algorithm>
int m, n;
int dir[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
char map[125][125];
char f;
int ans;
using namespace std;
void dfs(int x,int y)
{
for (int i = 0; i < 4; ++i)
{
int nx = x + dir[i][0],ny = y + dir[i][1];
if (nx < 1 || nx > m || ny < 1 || ny > n)
continue;
if (map[nx][ny] == f)
{
map[nx][ny] = ' ';
dfs(nx,ny);
}
else continue;
}
}
int main()
{
while (cin >> m >> n && (m || n))
{
for (int i = 1; i <= m; ++i)
for (int j = 1; j <= n; ++j)
cin >> map[i][j];
for (int i = 1; i <= m; ++i)
for (int j = 1; j <= n; ++j)
{
if (map[i][j] != ' ')
{
ans++;
f = map[i][j];
dfs(i,j);
}
}
cout << ans << endl;
}
return 0;
} | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s797381937 | p00118 | C | #include <stdio.h>
#define SQLOOP for(hi = 0;hi < h;hi++)for(wi = 0;wi < w;wi++)
char map[101][101];
short h,hi,w,wi,l,ans;
void mapInfr(short hj,short wj){
char base;
base = map[hj][wj];
map[hj][wj] = 0;
if(hj && mapInfr[hj - 1][wj] == base)mapInfr(hj - 1,wj);
if(wj && mapInfr[hj][wj - 1] == base)mapInfr(hj,wj - 1);
if(hj + 1 < h && mapInfr[hj + 1][wj] == base)mapInfr(hj + 1,wj);
if(wj + 1 < w && mapInfr[hj][wj + 1] == base)mapInfr(hj,wj + 1);
}
int main(void){
for(;;){
scanf("%d%d",&h,&w);
if(h == 0 && w == 0)break;
SQLOOP scanf("%c",&map[hi][wi]);
ans = 0;
SQLOOP if(map[hi][wi])mapInfr(hi,wi),ans++;
printf("%d\n",ans);
}
} | main.c: In function 'mapInfr':
main.c:11:25: error: subscripted value is neither array nor pointer nor vector
11 | if(hj && mapInfr[hj - 1][wj] == base)mapInfr(hj - 1,wj);
| ^
main.c:12:25: error: subscripted value is neither array nor pointer nor vector
12 | if(wj && mapInfr[hj][wj - 1] == base)mapInfr(hj,wj - 1);
| ^
main.c:13:33: error: subscripted value is neither array nor pointer nor vector
13 | if(hj + 1 < h && mapInfr[hj + 1][wj] == base)mapInfr(hj + 1,wj);
| ^
main.c:14:33: error: subscripted value is neither array nor pointer nor vector
14 | if(wj + 1 < w && mapInfr[hj][wj + 1] == base)mapInfr(hj,wj + 1);
| ^
|
s972834098 | p00118 | C | #include"queue"
#include"stdio.h"
#include"stdlib.h"
#include"string.h"
#include"algorithm"
using namespace std;
struct mmm
{
int x,y;
}vv;
int dir[4][2] = {0,-1,-1,0,0,1,1,0};
char xx[101][101];
int vis[101][101],m,n,maxx;
int check(int xn,int yn)
{
if(xn < 0 || yn < 0 || xn >= m || yn >= n)
return 0;
else
return 1;
}
void bfs(int xl,int yl,char pl)
{
queue <mmm> qq;
int sum = 0;
vv.x = xl;
vv.y = yl;
qq.push(vv);
vis[xl][yl] = 1;
xx[xl][yl] = '1';
while(!qq.empty())
{
vv = qq.front();
qq.pop();
int x0 = vv.x;
int y0 = vv.y;
for(int i = 0;i < 4;i ++)
{
int xt = x0 + dir[i][0];
int yt = y0 + dir[i][1];
if(check(xt,yt) && !vis[xt][yt] && xx[xt][yt] == pl)
{
vv.x = xt;
vv.y = yt;
qq.push(vv);
vis[xt][yt] = 1;
xx[xt][yt] = '1';
}
}
}
}
int main()
{
int a,b,c,d;
while(~scanf("%d %d",&m,&n))
{
if(!m && !n) break;
for(int i = 0;i < m;i ++)
{
scanf("%s",xx[i]);
}
memset(vis,0,sizeof(vis));
maxx = 0;
for(int i = 0;i < m;i ++)
{
for(int j = 0;j < n;j ++)
{
if(xx[i][j] != '1')
{
bfs(i,j,xx[i][j]);
maxx ++;
}
}
}
printf("%d\n",maxx);
}
return 0;
} | main.c:1:9: fatal error: queue: No such file or directory
1 | #include"queue"
| ^~~~~~~
compilation terminated.
|
s229902484 | p00118 | C | #include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
char ma[105][105];
int h, w, vis[105][105];
void dfs(int x, int y, char c)
{
int i, xx, yy;
for(i = 0; i < 4; i++)
{
xx = x + dx[i];
yy = y + dy[i];
if(xx >= 0 && xx < h && yy >= 0 && yy < w && !vis[xx][yy] && ma[xx][yy] == c)
{
vis[xx][yy] = 1;
dfs(xx, yy, c);
}
}
}
int main()
{
int i, j, ans;
while(scanf("%d%d", &h, &w) && (h || w))
{
getchar();
for(i = 0; i < h; i++) scanf("%s", ma[i]);
memset(vis, 0, sizeof vis);
ans = 0;
for(i = 0; i < h; i++)
{
for(j = 0; j < w; j++)
{
if(!vis[i][j])
{
ans++;
dfs(i, j, ma[i][j]);
}
}
}
printf("%d\n", ans);
}
return 0;
} | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s348821414 | p00118 | C | #include <stdio.h>
char s[128][128];//s[h][w]
char cs[4] = "@#*";
int h,w;
int sp = 0;
void check(int t,int sh,int sw){
int nh,nw;
s[sh][sw] = '.';
nh = sh - 1,nw = sw;
if(0 <= nh && nh < h && 0 <= nw && nw < w && s[nh][nw] == cs[t]) check(t,nh,nw);
nh = sh,nw = sw - 1;
if(0 <= nh && nh < h && 0 <= nw && nw < w && s[nh][nw] == cs[t]) check(t,nh,nw);
nh = sh,nw = sw + 1;
if(0 <= nh && nh < h && 0 <= nw && nw < w && s[nh][nw] == cs[t]) check(t,nh,nw);
nh = sh + 1,nw = sw;
if(0 <= nh && nh < h && 0 <= nw && nw < w && s[nh][nw] == cs[t]) check(t,nh,nw);
}
int main(void) {
int i,j,k;
while(scanf("%d%d",&h,&w) , h != 0){
sp = 0;
for(i = 0;i < 128;i++){
for(j = 0;j < 128;j++){
s[i][j] = '.'
}
}
for(i = 0;i < h;i++){
scanf("%s",s[i]);
}
for(i = 0;i <= 2 ;i++){
for(j = 0;j < h;j++){
for(k = 0;k < w;k++){
if(s[j][k] == cs[i]){
sp++;
check(i,j,k);
}
}
}
}
printf("%d\n",sp);
}
return 0;
} | main.c: In function 'main':
main.c:28:46: error: expected ';' before '}' token
28 | s[i][j] = '.'
| ^
| ;
29 | }
| ~
|
s225736229 | p00118 | C | #include <cstdio>
#include <cstring>
const int MAX_H = 100;
const int MAX_W = 100;
//?入
int H, W;
char g[MAX_H][MAX_W + 1];
int d[4][2] = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}}; //方向
//深度?先遍?g[i][j]同?局域
void dfs(int x, int y, int c){
for(int i = 0; i < 4; i ++){
int nx = x + d[i][0], ny = y + d[i][1];
if(0 <= nx && nx < H && 0 <= ny && ny < W && g[nx][ny] == c){
g[nx][ny] = '1';
dfs(nx, ny, c);
}
}
}
void solve(){
//遍?果?，?到一个新位置，遍??位置能到?的地方
int ans = 0;
for(int i = 0; i < H; i ++){
for(int j = 0; j < W; j ++){
if(g[i][j] != '1'){
ans ++;
char c = g[i][j];
g[i][j] = '1';
dfs(i, j, c);
}
}
}
printf("%d\n", ans);
}
int main(int argc, char const *argv[]){
while(scanf("%d %d", &H, &W)){
if(H == 0 && W == 0) break;
for(int i = 0; i < H; i ++){
scanf("%s", g[i]);
}
solve();
}
return 0;
} | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s890299821 | p00118 | C | #include <stdio.h>
#include <stdlib.h>
#include <conio.h>
void a(char c, char map[101][101], int i, int j, int H, int W) {
if (c == map[i][j]) map[i][j] = '0';
if (i+1 < H && map[i+1][j] == c) a(c,map,i+1,j,H,W);
if (j+1 < W && map[i][j+1] == c) a(c,map,i,j+1,H,W);
if (i-1 >= 0 && map[i-1][j] == c) a(c,map,i-1,j,H,W);
if (j-1 >= 0 && map[i][j-1] == c) a(c,map,i,j-1,H,W);
}
int main() {
int out, H, W, i, j;
char map[101][101];
while (1) {
out = 0;
scanf("%d%d", &H, &W);
if (H == W && H == 0) break;
for (i=0; i < H ;i++) {
for (j=0; j < W ;j++) {
scanf("%c", &map[i][j]);
if (map[i][j] == '\n') {
scanf("%c", &map[i][j]);
}
}
}
for (i=0; i < H ;i++) {
for (j=0; j < W ;j++) {
if (map[i][j] != '0') {
a(map[i][j], map, i, j, H, W);
out++;
}
}
}
printf("%d\n", out);
}
return 0;
} | main.c:3:10: fatal error: conio.h: No such file or directory
3 | #include <conio.h>
| ^~~~~~~~~
compilation terminated.
|
s207886012 | p00118 | C | #include<cstdio>
#include<cstring>
int h,w,ans,b[105][105],dr[5]={0,1,0,-1,0};
char a[105][105];
void dfs(int x,int y,char c)
{
if(x>h||y>w||x<0||y<0||a[x][y]!=c||b[x][y]) return;
b[x][y]=ans;
for(int i=1;i<=4;i++) dfs(x+dr[i-1],y+dr[i],c);
}
int main()
{
int i,j;
while(1)
{
scanf("%d%d",&h,&w);
if(!h) break;
for(i=1;i<=h;i++) scanf("%s",a[i]+1);
memset(b,0,sizeof(b));ans=0;
for(i=1;i<=h;i++)
for(j=1;j<=w;j++)
if(!b[i][j])
{
ans++;dfs(i,j,a[i][j]);
}
printf("%d\n",ans);
}
} | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s958552401 | p00118 | C | #include <bits/stdc++.h>
using namespace std;
int h,w,f[101][101],tot;
char s[101][101];
const int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
void dfs(int x,int y,char c)
{
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(nx>=1&&nx<=h&&ny>=1&&ny<=w&&!f[nx][ny]&&s[nx][ny]==c){
f[nx][ny]=1;
dfs(nx,ny,c);
}
}
}
int main()
{
#ifdef DEBUG
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
while(scanf("%d%d",&h,&w)&&h&&w){
memset(f,0,sizeof(f));
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
cin>>s[i][j];
tot=0;
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
if(!f[i][j]&&(s[i][j]=='@'||s[i][j]=='*'||s[i][j]=='#')){
f[i][j]=1;
tot++;
dfs(i,j,s[i][j]);
}
cout<<tot<<endl;
}
return 0;
} | main.c:1:10: fatal error: bits/stdc++.h: No such file or directory
1 | #include <bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s856880457 | p00118 | C | /*If I get TLE , it is good.If I get AC,it's NICE !*/
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int MAXN=1e7+10;
const ll mod=1e9+7;
using namespace std;
typedef long long ll;
char mp[1000][1000];
bool vis[1000][1000];
int dir[8][2]= {-1,0,1,0,0,-1,0,1,1,1,1,-1,-1,1,-1,-1};
int cnt=0;
int n,m;
char temp;
void dfs(int x,int y)
{
vis[x][y]=true;
for(int i=0; i<4; i++)
{
int nx=x+dir[i][0];
int ny=y+dir[i][1];
if(nx>=0 && nx<=n-1 && ny>=0 && ny<=m-1 && vis[nx][ny]==false && mp[nx][ny]==temp)
{
vis[nx][ny]=true;
dfs(nx,ny);
}
}
}
int main(void)
{
while((scanf("%d%d",&n,&m))==2)
{
if(m==0 && n==0)
return 0;
cnt=0;
memset(vis,false,sizeof(vis));
for(int i=0; i<n; i++)
scanf("%s",mp[i]);
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
if(vis[i][j]==false)
{
temp=mp[i][j];
dfs(i,j);
cnt++;
}
}
}
printf("%d\n",cnt);
}
} | main.c:3:10: fatal error: iostream: No such file or directory
3 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s895413519 | p00118 | C | #include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int h, w;
char c[110][110];
bool f[110][110];
int next[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int cnt = 0;
void dfs(int i, int j){
for(int k = 0; k <= 3; k++){
int ii = i + next[k][0];
int jj = j + next[k][1];
if(ii > h || ii <= 0 || jj > w || jj <= 0 || f[ii][jj] == 1){
continue;
}
f[ii][jj] = 1;
dfs(ii, jj);
}
}
void solve(char s){
memset(f, 0, sizeof(f));
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
if(c[i][j] != s){
f[i][j] = 1;
}
}
}
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
if(f[i][j] == 0){
cnt++;
dfs(i, j);
}
}
}
}
int main(){
while(~scanf("%d%d", &h, &w)){
if(h == 0 || w == 0)break;
cnt = 0;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
cin>>c[i][j];
}
}
solve('#');
solve('*');
solve('@');
printf("%d\n", cnt);
}
return 0;
} | main.c:1:9: fatal error: algorithm: No such file or directory
1 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s973016704 | p00118 | C | #include <iostream>
#include<cstdio>
#include<cmath>
#include<string.h>
#include<algorithm>
#include<queue>
#include<list>
#include<vector>
#include<stdlib.h>
#include<stack>
#define oo 0x3f3f3f3f
using namespace std;
int n, m;
char str[105][105];
int ans[4][2]={{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int vis[105][105];
void dfs(int x, int y, char c)
{
if(str[x][y]!=c)
return ;
vis[x][y]=1;
for(int i=0; i<8; i++)
{
int nx=x+ans[i][0];
int ny=y+ans[i][1];
if(nx>=0&&nx<n&&ny>=0&&ny<m&&str[nx][ny]==c&&!vis[nx][ny])
{
vis[nx][ny]=1;
dfs(nx, ny, c);
}
}
return ;
}
int main()
{
while(scanf("%d%d", &n, &m), n+m)
{
for(int i=0; i<n; i++)
scanf("%s", str[i]);
memset(vis, 0, sizeof(vis));
int sum=0;
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
if(!vis[i][j])
{
dfs(i, j, str[i][j]);
sum++;
}
}
}
printf("%d\n", sum);
}
return 0;
} | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s618781324 | p00118 | C | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#include<queue>
int n,m;
int dis[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
#define N 110
char map[N][N];
struct node
{
int x,y;
};
void bfs(int i,int j,char s)
{
queue<node>Q;
node now,next;
now.x=i;
now.y=j;
map[i][j]='E';
Q.push(now);
while(Q.size())
{
now=Q.front();
Q.pop();
for(int i=0;i<4;i++)
{
next.x=now.x+dis[i][0];
next.y=now.y+dis[i][1];
if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m&&map[next.x][next.y]==s)
{
map[next.x][next.y]='E';
Q.push(next);
}
}
}
}
int main()
{
while(scanf("%d%d",&n,&m),n+m)
{
getchar();
for(int i=0;i<n;i++)
{
scanf("%s",map[i]);
}
int sum=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
if(map[i][j]=='#'||map[i][j]=='@'||map[i][j]=='*')
{
sum++;
bfs(i,j,map[i][j]);
}
}
printf("%d\n",sum);
}
return 0;
} | main.c:3:9: fatal error: algorithm: No such file or directory
3 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s833631829 | p00118 | C | #include<stdio.h>
#include<iostream>
#include<string.h>
int H,W;
char map[100][100];
void flood(int typ, int x,int y){
map[y][x]='X';
printf("rewritten: map[%d][%d]:%c\n",y,x,map[y][x]);
//up
if(y-1>=0&&map[y-1][x]==typ)flood(typ,x,y-1);
//right
if(x+1<W&&map[y][x+1]==typ)flood(typ,x+1,y);
//down
if(y+1<H&&map[y+1][x]==typ)flood(typ,x,y+1);
//left
if(x-1>=0&&map[y][x-1]==typ)flood(typ,x-1,y);
}
int main(){
while(scanf("%d%d",&H,&W)!=EOF){if(H==0&&W==0)return 0;
for(int i=0;i<H;i++)scanf("%s",&map[i]);
int count=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(map[i][j]!='X'){flood(map[i][j],j,i);count++;}
}
}printf("%d\n",count);
}return 0;
} | main.c:2:9: fatal error: iostream: No such file or directory
2 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s681771687 | p00118 | C | #include<stdio.h>
#include<iostream>
using namespace std;
char maze[120][120];
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int m,n;
int dfs(int x,int y,char c)
{
maze[x][y]='.';
for(int i=0;i<4;i++)
{
int cx=x+dx[i];
int cy=y+dy[i];
if(cx>0&&cx<=m&&cy>0&&cy<=n&&maze[cx][cy]==c)
{
dfs(cx,cy,c);
}
}
}
int main()
{
char ch;
while(scanf("%d%d%c",&m,&n,&ch)==3&&m&&n)
{
int Kount=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%c",&maze[i][j]);
}
scanf("%c",&ch);
}
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(maze[i][j]!='.')
{
Kount++;
dfs(i,j,maze[i][j]);
}
}
}
printf("%d\n",Kount);
}
return 0;
} | main.c:2:9: fatal error: iostream: No such file or directory
2 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s845872265 | p00118 | C | #include<iostream>
#include<string.h>
using namespace std;
char field[200][200];
int bench[200][200];
int cnt = 0;
int search(int x, int y,char ch);
int main()
{
int h, w;
while (1)
{
cin >> h >> w;
if (h == 0 && w == 0)break;
memset(bench, -1, sizeof(bench));
memset(field, '\0', sizeof(field));
for (int i = 1; i <= h; i++)
{
for (int j = 1; j <= w; j++)
{
cin >> field[i][j];
bench[i][j] = 0;
}
}
for (int i = 1; i <= h; i++)
for (int j = 1; j <= w; j++)
cnt+=search(i, j,field[i][j]);
printf("%d\n",cnt);
cnt = 0;
}
return 0;
}
int search(int x, int y,char ch)
{
if (bench[x][y]==-1)return 0;
if (field[x][y] != ch)return 0;
bench[x][y] = -1;
search(x, y + 1,ch);
search(x, y - 1,ch);
search(x + 1, y,ch);
search(x - 1, y,ch);
return 1;
} | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s836366567 | p00118 | C | #include<iostream>
#include<algorithm>
using namespace std;
#define N 10
int h, w;
char map[N][N+1];
int cnt;
void dfs(int x, int y, char c)
{
map[x][y] = 'X';
int d[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
for (int i = 0; i < 4; i ++)
{
int nx = x + d[i][0], ny = y + d[i][1];
if (0 <= nx && nx < h && 0 <= ny && ny < w && map[nx][ny] == c)
{
dfs(nx, ny, c);
}
}
}
void solve()
{
cnt = 0;
for(int i = 0; i < h; i++)
{
for(int j = 0; j < w; j++)
{
if(map[i][j] != 'X')
{
dfs(i, j, map[i][j]);
cnt++;
}
}
}
cout << cnt << endl;
}
int main()
{
while(cin >> h >> w, h && w)
{
for(int i = 0; i < h; i++)
cin >> map[i];
solve();
}
return 0;
} | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s527231920 | p00118 | C | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
using namespace std;
const int maxn = 101;
char g[maxn][maxn];
int d[4][2] = {0 , 1 , 1 , 0 , 0 , -1 , -1 ,0};
void dfs(int si , int sj , int n , int m , char ch)
{
g[si][sj] = '1';
for(int i = 0 ; i < 4 ; i ++){
int x = si + d[i][0];
int y = sj + d[i][1];
if(x < 0 || x >= n || y < 0 || y >= m || g[x][y] != ch) continue;
dfs(x , y , n , m , ch);
}
}
int main()
{
#ifdef DoubleQ
freopen("in.txt" , "r" , stdin);
#endif // DoubleQ
int n , m;
while(cin >> n >> m){
if(n == 0 && m == 0) break;
string str;
for(int i = 0 ; i < n ; i ++){
cin >> str;
for(int j = 0 ; j < m ; j ++){
g[i][j] = str[j];
}
}
int cnt = 0;
/*
for(int i = 0 ; i < n ;i ++){
for(int j = 0 ; j < m ; j ++){
cout << g[i][j] << " ";
}
cout << endl;
}
*/
for(int i = 0 ; i < n ; i ++){
for(int j = 0 ; j < m ; j ++){
if(g[i][j] != '1'){
dfs(i , j , n , m , g[i][j]);
cnt ++;
}
}
}
cout << cnt << endl;
}
} | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s168797546 | p00118 | C | #include<cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
int n,m;
char field[101][101];
int sum=0;
char index;
void dfs(int r,int c)
{
if(r<0 || r>=n || c<0 || c>=m || field[r][c]!=index)
return;
else{
field[r][c]='.';
dfs(r-1,c);
dfs(r,c-1);
dfs(r,c+1);
dfs(r+1,c);
}
}
int main()
{
while(cin>>n>>m &&m&&n){
sum=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>field[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(field[i][j]!='.')
{
index=field[i][j];
sum++;
dfs(i,j);
}
}
}
cout<<sum<<endl;
}
system("pause");
return 0;
} | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s402935644 | p00118 | C | #include <iostream>
#include <algorithm>
#include <functional>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int n,m,dx[]={-1,1,0,0},dy[]={0,0,-1,1};
char a[1002][1002];
bool v[1002][1002];
void dfs(int x,int y,char c)
{
if(v[x][y])return;
if(a[x][y]!=c)return;
v[x][y]=1;
for(int i=0;i<4;++i)
{
dfs(x+dx[i],y+dy[i],c);
}
}
int main()
{
while(1)
{
scanf("%d%d",&n,&m);getchar();
if(n==0&&m==0)break;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
scanf("%c",&a[i][j]);
}
getchar();
}
int cnt=0;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
if(!v[i][j])
{
++cnt;
dfs(i,j,a[i][j]);
}
}
}
printf("%d\n",cnt);
}
return 0;
} | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s959058376 | p00118 | C | #include <stdio.h>
int k,t=0;
char a[100][100];
void bfs(int i,int j,int n,int m,char x)
{
k=0;
if (i<0||j<0||i>=n||j>=m||a[i][j]=='\0'||a[i][j]!=x) return ;
a[i][j]='\0';
bfs(i-1,j,n,m,x);
bfs(i+1,j,n,m,x);
bfs(i,j-1,n,m,x);
bfs(i,j+1,n,m,x);
k++;
}
int main ()
{
int n,m,i,j;
while (scanf ("%d%d",&n,&m)!=EOF)
{
if (n==0&&m==0) return 0;
getchar();
for (i=0;i<n;i++)
gets(a[i]);
for (i=0;i<n;i++)
for (j=0;j<m;j++)
{
bfs(i,j,n,m,a[i][j]);
if (k!=0) t++;
}
printf ("%d\n",t);
}
return 0;
}
| main.c: In function 'main':
main.c:23:17: error: implicit declaration of function 'gets'; did you mean 'fgets'? [-Wimplicit-function-declaration]
23 | gets(a[i]);
| ^~~~
| fgets
|
s286032409 | p00118 | C | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int sum,n,m;
int k;
char map[105][105];
int dx[10]={-1,1,0,0};
int dy[10]={0,0,-1,1};
void dfs1(int x,int y)
{
if(x<0||x>=n||y<0||y>=m) return ;
if(map[x][y]=='#')
{
map[x][y]=' ';
for(int i=0;i<4;i++)
{
dfs1(x+dx[i],y+dy[i]);
}
}
}
void dfs2(int x,int y)
{
if(x<0||x>=n||y<0||y>=m) return ;
if(map[x][y]=='@')
{
map[x][y]=' ';
for(int i=0;i<4;i++)
{
dfs2(x+dx[i],y+dy[i]);
}
}
}
void dfs3(int x,int y)
{
if(x<0||x>=n||y<0||y>=m) return ;
if(map[x][y]=='*')
{
map[x][y]=' ';
for(int i=0;i<4;i++)
{
dfs3(x+dx[i],y+dy[i]);
}
}
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{ getchar();
if(m==0||n==0) break;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
scanf("%c",&map[i][j]) ;
}
getchar();
}
sum=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]=='#')
{
sum++;
dfs1(i,j);
}
if(map[i][j]=='@')
{
sum++;
dfs2(i,j);
}
if(map[i][j]=='*')
{
sum++;
dfs3(i,j);
}
}
}
printf("%d\n",sum);
}
return 0;
}
| main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.