0_0_28148786_22489\Main.java:1: 错误: 非法字符: '#'
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 非法字符: '#'
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (scanf("%d",&N)!=EOF) { memset(W, '0', sizeof(W)); SUM = 0; for (i = 1; i <= N; i++)//行 for (j = 1; j <= N; j++)//列 cin >> W[i][j];//无需考虑清空缓存 Calculate(N); printf("%d\n", SUM); } }
^
0_0_28148786_22489\Main.java:1: 错误: 需要class, interface或enum
#include<stdio.h> #include <iostream> using namespace std; char W[101][101]; int SUM; void Calculate(short N){ short i, j, k, l, temp; for(i = 1; i <= N; i++) for (j = 1; j <= N; j++){ temp = N; if(W[i][j] == '#')continue; SUM++;//此块为白块 for (k = j; k <= N; k++){ if(k != j){ if (W[i][k] == '#')break; SUM++; } for (l = i + 1; l <= temp; l++){ if (W[l][k] == '#') { temp = l - 1; break; } SUM++; } } } } int main(){ short N, i, j; while (sc
|
