\u670d\u52a1\u5668\u8fde\u63a5\u65b9\u5f0f\u5305\u62ec\u76f4\u63a5\u76f8\u8fde，\u95f4\u63a5\u8fde\u63a5\u3002<\/p>\n
A\u548cB\u76f4\u63a5\u8fde\u63a5，B\u548cC\u76f4\u63a5\u8fde\u63a5，\u5219A\u548cC\u95f4\u63a5\u8fde\u63a5\u3002<\/p>\n
\u76f4\u63a5\u8fde\u63a5\u548c\u95f4\u63a5\u8fde\u63a5\u90fd\u53ef\u4ee5\u53d1\u9001\u5e7f\u64ad\u3002<\/p>\n
\u7ed9\u51fa\u4e00\u4e2aN*N\u6570\u7ec4，\u4ee3\u8868N\u4e2a\u670d\u52a1\u5668，<\/p>\n
matrix[i][j] == 1， \u5219\u4ee3\u8868i\u548cj\u76f4\u63a5\u8fde\u63a5；\u4e0d\u7b49\u4e8e 1 \u65f6，\u4ee3\u8868i\u548cj\u4e0d\u76f4\u63a5\u8fde\u63a5\u3002<\/p>\n
matrix[i][i] == 1，<\/p>\n
\u5373\u81ea\u5df1\u548c\u81ea\u5df1\u76f4\u63a5\u8fde\u63a5\u3002matrix[i][j] == matrix[j][i]\u3002<\/p>\n
\u8ba1\u7b97\u521d\u59cb\u9700\u8981\u7ed9\u51e0\u53f0\u670d\u52a1\u5668\u5e7f\u64ad， \u624d\u53ef\u4ee5\u4f7f\u6bcf\u4e2a\u670d\u52a1\u5668\u90fd\u6536\u5230\u5e7f\u64ad\u3002<\/p>\n
\u8f93\u5165\u4e3aN\u884c，\u6bcf\u884c\u6709N\u4e2a\u6570\u5b57，\u4e3a0\u62161，\u7531\u7a7a\u683c\u5206\u9694，<\/p>\n
\u6784\u6210N*N\u7684\u6570\u7ec4，N\u7684\u8303\u56f4\u4e3a\u00a01 <= N <= 40<\/p>\n
\u8f93\u51fa\u4e00\u4e2a\u6570\u5b57，\u4e3a\u9700\u8981\u5e7f\u64ad\u7684\u670d\u52a1\u5668\u7684\u6570\u91cf<\/p>\n
\u8f93\u5165<\/p>\n
1 0 0
\n0 1 0
\n0 0 1<\/p>\n
\u8f93\u51fa<\/p>\n
3<\/p>\n
\u8bf4\u660e<\/p>\n
3 \u53f0\u670d\u52a1\u5668\u4e92\u4e0d\u8fde\u63a5，\u6240\u4ee5\u9700\u8981\u5206\u522b\u5e7f\u64ad\u8fd9 3 \u53f0\u670d\u52a1\u5668<\/p>\n<\/p>\n
\u8f93\u5165<\/p>\n
1 1
\n1 1<\/p>\n
\u8f93\u51fa<\/p>\n
1<\/p>\n
\u8bf4\u660e<\/p>\n
2 \u53f0\u670d\u52a1\u5668\u76f8\u4e92\u8fde\u63a5，\u6240\u4ee5\u53ea\u9700\u8981\u5e7f\u64ad\u5176\u4e2d\u4e00\u53f0\u670d\u52a1\u5668<\/p>\n
#include <iostream>
\n#include <vector>
\nusing namespace std;<\/p>\n
int count = 0;<\/p>\n
void dfs(vector<vector<int>>& arr, vector<bool>& visited, int index) {
\n visited[index] = true;
\n bool flag = true;
\n for (int i = index + 1; i < arr.size(); i++) {
\n if (arr[index][i] == 1) {
\n flag = false;
\n dfs(arr, visited, i);
\n }
\n }
\n if (flag) {
\n count++;
\n }
\n}<\/p>\n
int main() {
\n string input;
\n getline(cin, input);
\n vector<string> str;
\n size_t pos = 0;
\n while ((pos = input.find(" ")) != string::npos) {
\n str.push_back(input.substr(0, pos));
\n input.erase(0, pos + 1);
\n }
\n str.push_back(input);
\n int n = str.size();
\n vector<vector<int>> arr(n, vector<int>(n, 0));
\n for (int i = 0; i < n; i++) {
\n arr[0][i] = stoi(str[i]);
\n }
\n for (int i = 1; i < n; i++) {
\n getline(cin, input);
\n pos = 0;
\n vector<string> s;
\n while ((pos = input.find(" ")) != string::npos) {
\n s.push_back(input.substr(0, pos));
\n input.erase(0, pos + 1);
\n }
\n s.push_back(input);
\n for (int j = 0; j < n; j++) {
\n arr[i][j] = stoi(s[j]);
\n }
\n }
\n vector<bool> visited(n, false);
\n for (int i = 0; i < n; i++) {
\n if (!visited[i]) {
\n dfs(arr, visited, i);
\n }
\n }
\n cout << count << endl;
\n return 0;
\n}<\/p>\n
import java.util.*;<\/p>\n
public class Main {
\n public static void main(String[] args) {
\n Scanner in = new Scanner(System.in);
\n String[] str = in.nextLine().split(" ");
\n int n = str.length;
\n int[][] arr = new int[n][n];
\n for(int i = 0; i < n; i++) {
\n arr[0][i] = Integer.parseInt(str[i]);
\n }
\n for(int i = 1; i < n; i++) {
\n String[] s = in.nextLine().split(" ");
\n for(int j = 0; j < n; j++) {
\n arr[i][j] = Integer.parseInt(s[j]);
\n }
\n }
\n int count = 0;
\n Queue<Integer> queue = new LinkedList<>();
\n for(int i = 0; i < n; i++) {
\n if(!queue.contains(i)) {
\n dfs(arr, queue, i);
\n count++;
\n }
\n }
\n System.out.println(count);
\n }<\/p>\n
public static void dfs(int[][] arr, Queue<Integer> queue, int index) {
\n queue.offer(index);
\n for (int i = index + 1; i < arr.length; i++) {
\n if (arr[index][i] == 1 && !queue.contains(i)) {
\n dfs(arr, queue, i);
\n }
\n }
\n }
\n}<\/p>\n
import sys<\/p>\n
def dfs(arr, visited, index):
\n visited[index] = True
\n flag = True
\n for i in range(index + 1, len(arr)):
\n if arr[index][i] == 1:
\n flag = False
\n dfs(arr, visited, i)
\n if flag:
\n global count
\n count += 1<\/p>\n
count = 0
\nstr = input().split(" ")
\nn = len(str)
\narr = [[0]*n for _ in range(n)]
\nfor i in range(n):
\n arr[0][i] = int(str[i])
\nfor i in range(1, n):
\n s = input().split(" ")
\n for j in range(n):
\n arr[i][j] = int(s[j])
\nvisited = [False]*n
\nfor i in range(n):
\n if not visited[i]:
\n dfs(arr, visited, i)
\nprint(count)<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb8.6k\u6b21\uff0c\u70b9\u8d5e73\u6b21\uff0c\u6536\u85cf57\u6b21\u3002\u3010\u534e\u4e3aOD\u673a\u8bd5B\u5377\u3011\u670d\u52a1\u5668\u5e7f\u64ad\u3001\u9700\u8981\u5e7f\u64ad\u7684\u670d\u52a1\u5668\u6570\u91cf\uff08C++\/Java\/Python\uff09<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[1568,55,99,81,447,1569,427],"topic":[],"class_list":["post-20138","post","type-post","status-publish","format-standard","hentry","category-server","tag-2024odc-c-java-py","tag-c","tag-java","tag-python","tag-od","tag-1569","tag-427"],"yoast_head":"\n