1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T499,#include using namespace std; vector adj[101]; vector> cc; bool seen[101]; int fardist[101]; void findcc(int i) { seen[i] = true; for(int a: adj[i]) { if(!seen[a]) { cc.back().push_back(a); findcc(a); } } } int main() { ios::sync_with_stdio(0);cin.tie(0); int n, k; cin >> n >> k; while(k--) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for(int i=1; i<=n; i++) { if(!seen[i]) { cc.push_back({i}); findcc(i); } } for(int i=1; i<=n; i++) { queue que; que.push(i); memset(seen, 0, sizeof seen); seen[i] = true; int d = 0; while(!que.empty()) { int s = que.size(); while(s--) { int q = que.front(); que.pop(); for(int a: adj[q]) { if(!seen[a]) { seen[a] = true; que.push(a); } } } d++; } fardist[i] = max(0, d-2); } cout << cc.size() << '\n'; vector ans; for(int i=0; i

코드 #5901