c++

#include<bits/stdc++.h> using namespace std; int p[10]; int findset(int x){ return p[x] == x ? x : p[x] = findset(p[x]); } int main(){ int n = 8; for(int i = 1; i <= n; ++i){ p[i] = i; } p[findset(1)] = findset(3); p[findset(2)] = findset(8); p[findset(3)] = findset(5); p[findset(7)] = findset(4); int tot = 0; for(int i = 1; i <= 8; ++i){ tot += (p[i] == i); } cout<< tot << endl; return 0; } 上述程序的输出为( )

0个评论
点击登录,快来和大家讨论吧~
表情
图片
暂无评论
编程导航
下载 APP