Search found 28 matches

by Zuberul
Sun Jan 16, 2005 7:42 pm
Forum: Volume 105 (10500-10599)
Topic: 10509 - R U Kidding Mr. Feynman?
Replies: 41
Views: 13783

yes thats right
now... i cant tell much.because its a straight forward problem.
check you are giving correct output for maximum inputs.

hope it helps.
by Zuberul
Thu Jan 06, 2005 6:30 pm
Forum: Volume 105 (10500-10599)
Topic: 10509 - R U Kidding Mr. Feynman?
Replies: 41
Views: 13783

Check your output for input 1.0000
by Zuberul
Wed Dec 22, 2004 10:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37159

yep man I got AC with Floyd Warshall at last.
But i still cant imagine why bfs fails here.
Thanks for the help.
by Zuberul
Tue Dec 21, 2004 10:26 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37159

My code pass this one also. So i am now posting my code. #include<stdio.h> #define SIZE 110 typedef struct{ int paths[SIZE]; int dis; }vertex; vertex p[SIZE]; int max,end,start,que[SIZE],size,head,tail; void addque(int a) { que[tail]=a; size++; tail=((tail+1)%SIZE); } int getque() { int temp; size--...
by Zuberul
Tue Dec 21, 2004 10:20 pm
Forum: Volume 1 (100-199)
Topic: 119 - Greedy Gift Givers
Replies: 145
Views: 26615

I got ac.
by Zuberul
Mon Dec 20, 2004 10:19 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37159

My code gives the same output.
Then what might be the problem.
please give me more I/O
by Zuberul
Mon Dec 20, 2004 10:16 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 25605

Thanks a lot man.I got AC :D
by Zuberul
Mon Dec 20, 2004 5:39 am
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 25605

I used disjoint set union-find data structure & got a WA.
help me with some I/O.
by Zuberul
Mon Dec 20, 2004 5:17 am
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37159

I also tried DFS earlier but managed to get a WA.
and again WA with BFS.
I cant find out what i am missing.
give me some input cases.
by Zuberul
Wed Dec 15, 2004 9:27 am
Forum: Volume 1 (100-199)
Topic: 119 - Greedy Gift Givers
Replies: 145
Views: 26615

119-sample I/O

I cant find out why WA.
My code got Accepted on the usaco judge but wa here.
what is the case?
give me some sample I/O.
by Zuberul
Sat Dec 11, 2004 11:05 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37159

Need I/O-10000

I used bfs & got WA
someone please give me some I/O.
Is there any tricky cases?
by Zuberul
Fri Nov 26, 2004 10:39 pm
Forum: Volume 4 (400-499)
Topic: 453 - Intersecting Circles
Replies: 84
Views: 15562

About 453.

Hi what is the problem with this one. I am getting continous WA. my algo... checked whether they are on straight line or not. then checked whether they are touching (both internaly or externaly) then 1. find the eqn of the common chord 2.find the eqn of the line joining the centers 3.got the interse...
by Zuberul
Sun Nov 21, 2004 11:10 pm
Forum: Volume 2 (200-299)
Topic: 280 - Vertex
Replies: 95
Views: 22645

I used just dfs & cant find out why WA? here is my code #include<stdio.h> #include<malloc.h> #define SIZE 200 typedef struct node{ int paths[SIZE]; int isVisited; }vertex; vertex *p; int reachable; void DFS(int i) { int j; j=0; while(p .paths[j]>=0 && p[p .paths[j]].isVisited==-1) { p[p .paths[j]].i...

Go to advanced search