Search found 7 matches

by Anupam Pathak
Fri Jun 08, 2007 3:07 pm
Forum: Volume 3 (300-399)
Topic: 315 - Network
Replies: 68
Views: 21467

Should root always articulation point?

Hello all, I am trying to solve 315 by finding articulation points, but I stuck in a case where I am not sure root should be declare as articulation point even though it has more than two descendants. Is it always necessary to declare root as articulation point in this case. In fact, I think we are ...
by Anupam Pathak
Tue Oct 31, 2006 6:06 am
Forum: Volume 7 (700-799)
Topic: 725 - Division
Replies: 49
Views: 19672

thanx sir,
though I have solve the problem,,
thanx very much :D
by Anupam Pathak
Sun Oct 29, 2006 3:45 pm
Forum: Volume 7 (700-799)
Topic: 725 - Division
Replies: 49
Views: 19672

725 Wrong Answer

Hi all,
I tried to solve 725 "Division" problem but i m getting wrong answer.
I am posting my code. Please give me some more test cases, so that i can find my error.

thanx very much..
by Anupam Pathak
Tue Aug 22, 2006 2:55 pm
Forum: Volume 4 (400-499)
Topic: 496 - Simply Subsets
Replies: 48
Views: 9218

496 WA

Hi all, I am really frustrated, :( I am always getting WA...... I have tried all the test cases which can be related with a set...... but i m not getting what to do...... please help me...... #include<iostream> #include<set> #include<string> #include<algorithm> #include<cstdio> using namespace std; ...
by Anupam Pathak
Fri Aug 04, 2006 4:17 pm
Forum: Volume 4 (400-499)
Topic: 400 - Unix ls
Replies: 93
Views: 17462

400 P.E.

hello all,
i have solved 400, but it is accepted with presentation error.... can anyone tell me what's the problem the problem.......

Please tell me..... what's wrong........
thanx.....
by Anupam Pathak
Thu Jul 27, 2006 7:21 pm
Forum: Volume 2 (200-299)
Topic: 224 - Kissin' Cousins
Replies: 0
Views: 1143

224 - Kissin' Cousins

hi all, I dont understand why is it not working...... #include<iostream> #include<string> #include<cstdio> using namespace std; int main() { string a[100],c,d; char b[100],f[100]; int x[100],j,k,max=0,sum,i=0,y=0; while(1) { cin>>a ; if(a [0]=='0') break; x =a .length(); i++; } for(j=0;j<i;j++) { if...
by Anupam Pathak
Tue Jul 25, 2006 2:05 pm
Forum: Volume 1 (100-199)
Topic: 191 - Intersection
Replies: 103
Views: 18378

191 Wrong Answer

hi all, i am trying to solve 191 Intersection in C++ but I am getting WA. I have considered as much cases as I could. My code is:- #include<iostream> using namespace std; int check(float,float,float,float,float,float); int main() { int N,i=0; cin>>N; float m,c,x,y; int xstart,xend,ystart,yend,xleft,...

Go to advanced search