If you don’t know then flags are managed by moderators.
shoo !
It’s your inability to infer things, you better learn to respect anyone who’s trying to help.
1 Like
it’s amazing how people are more attracted to useless conflicts rather than taking up problems and challenges !
Let Him Reply What Is Your Going??
bruh thing is, other programmers don’t reply to ur posts if such a high-rated one does
nope, brother ! this doesn’t work. You can try making that modification in my code urself and check. @sebastian please be vigilant if a solution really works, before taking down any posts
lol , u just assume , only
can u risk solving the problem, brother?
totally silent when asked to solve a problem? nice.
Just find the number of connected components, it’s probably the most basic problem that one learns while starting off with graphs.
1 Like
A human is more respected than a question 
1 Like
This post was flagged by the community and is temporarily hidden.
pls correct the code.
I already solved brother , it’s your time now , I have some other works too , @cubefreak777 already replied you , and you have no manners man , at least now I m not replying you , thanks.
1 Like
Fails for this test-case
1
10 8
10 1
2 1
2 11
4 1
5 3
6 7
4 5
11 5
Okay thanks, I will look for these cases, brother !
bruh, I’m currently in my first year of my U.G. degree, so this was literally my first problem with graphs, in my self-learning journey. I got that code corrected to a large extent, and I know I’ve complicated it, but it now gives WA at 2.05 sec. Here’s the edited code: code1.txt - Google Drive
And, you’re the one, bro !
Now got it totally correct, cheers, bro!
And This Proves That U Don’t Respect Anyone, Mate 
1 Like