0_0_38998047_2779\Main.java:1: 错误: 需要class, interface或enum
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 非法字符: '#'
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 需要class, interface或enum
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 非法字符: '#'
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 非法字符: '#'
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 非法字符: '#'
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 需要class, interface或enum
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 int upper = 1 << n, ans = 0;20 for (int i = 0; i < n; i ++) {21 memset(dp, 0, sizeof(dp));22 dp[1 << i][1 << i] = 1;23 24 for (int mask = 0; mask < upper; mask ++)25 for (int s = mask; s; s = (s - 1) & mask)26 for (int u = 0; u < n; u ++) if (mask & (1 << u))27 for (int v = 0; v < n; v ++) if ((mask & (1 << v)) == 0 && g[u][v]) {28 int m1 = mask | (1 << v);29 int m2 = (s | (1 << v)) & (~(1 << u));30 if (((1 << (v + 1)) - 1) >= m2) dp[m1][m2] += dp[mask][s];31 }32 33 for (int s = 0; s < upper; s ++) ans += dp[upper - 1][s];34 }35 36 printf("%d\n", ans);37 }38 return 0;39 }
^
0_0_38998047_2779\Main.java:1: 错误: 需要class, interface或enum
1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 const int MAX_N = 8, MAX_S = 1 << MAX_N; 8 int n, m, t, dp[MAX_S][MAX_S]; 9 char g[MAX_N][MAX_N + 1];10 11 int main() {12 while (scanf("%d", &n) != EOF) {13 if (!n) break;14 for (int i = 0; i < n; i ++) {15 scanf("%s", g[i]);16 for (int j = 0; j < n; j ++) g[i][j] -= '0';17 }18 19 i
|
