Problem 128732 >> @所有人 |
zhangxuanzhen @ 2025-06-30 17:23:55
额
|
zhangxuanzhen @ 2025-06-30 17:24:08
真的?
|
zhangxuanzhen @ 2025-06-30 17:24:36
呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜呜
|
zhangxuanzhen @ 2025-06-30 17:29:13
不是,你不学了有不代表你这个用户会删
|
zhangxuanzhen @ 2025-06-30 17:33:20
所以你有50%的可能会和我们聊天
|
xieshengrui @ 2025-07-08 09:07:47
#include<bits/stdc++.h>
using namespace std; int n,m,a[1000][1000],v[1000],x,y; int main() { cin>>n>>m; for(int i=0;i<m;i++){ cin>>x>>y; a[x][y]=1; a[y][x]=1; } queue<int>q; q.push(1); v[1]=1; while(!q.empty()){ int d=q.front(); cout<<d<<" "; q.pop(); for(int j=1;j<=m;j++){ if(a[d][j]==1&&v[j]==0){ q.push(j); v[j]=1; } } } return 0; } |
pengyubo @ 2025-07-10 13:15:35
再见再见再见再见再见再见
|
sunyicheng @ 2025-07-10 14:01:26
再见再见
|
luoen @ 2025-07-13 14:05:45
再见
|
luoen @ 2025-07-13 18:48:18
别发了,可能有人会举报,我就被举报过
|
luoen @ 2025-07-15 14:12:44
???
|
luoen @ 2025-07-15 14:12:54
啊?
|
luoen @ 2025-07-15 14:13:14
zhaodongqiang你不是说你不能聊天了吗
|
zhangxuanzhen @ 2025-07-15 19:37:42
9494
|
gezijian @ 2025-07-17 14:33:48
+1
|
gezijian @ 2025-07-17 14:33:58
+1
|
gaoyuanhang @ 2025-07-29 15:19:50
iowa;ldkkkkkkkkkf;
|
gaoyuanhang @ 2025-07-29 15:30:20
E222222222222222222222222222222222222222221F1F1F1F1F1F1F3
|
gaoyuanhang @ 2025-08-02 13:36:51
gfh
|
gaoyuanhang @ 2025-08-02 13:37:03
yyyyyyyyyyyyyyyyyyyyyyyyy44455555555555
|
gaoyuanhang @ 2025-08-02 13:55:25
yyyyyyyyyyyyyyyyyyyyyyyyy44455555555555
|
yuzihao @ 2025-10-02 17:21:53
啊发射点发生
|
yuzihao @ 2025-10-03 17:27:01
qwer
|