Search found 13 matches

by Hector_Hsu
Fri Sep 14, 2007 5:28 pm
Forum: Bugs and suggestions
Topic: Where are the new ranklist and complete author statistics?
Replies: 1
Views: 2193

Where are the new ranklist and complete author statistics?

As title, they were disabled on the old server and I can't see any clue in the new interface .. :o

Thanks for any response,
Hector
by Hector_Hsu
Sat Sep 08, 2007 1:43 pm
Forum: Bugs and suggestions
Topic: About the new server
Replies: 5
Views: 2912

About the new server

Hello I'am a 2-year user

The new server and the new ACM online looks cool but..

when I click "browse problems" and then check about "Volume C"

It spent 1 minutes to wait for the probelmset show, a little too slow, you know.... may be TLE :D




Hope it will be improved : )

thanks
by Hector_Hsu
Wed Aug 16, 2006 5:42 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17378

And finally I get Accepted. :D The bug is that when I implement my Dijkstra's algorithm, I use "heap" to be a min-priority queue. And I forget to maintain the min-priority property everytime I make some action to the heap...... It's just a silly mistake....but I think it is easily to be ignored....^^"
by Hector_Hsu
Wed Aug 16, 2006 5:36 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17378

DP: Take a example, assume there are 5 nodes. A,B,C,D,E The program will run five times , k = A to E for k = A: Begin with node A , use Dijkstra's to travel the graph then I get the shortest paths to B,C,D,E that 4 value will be added to the dist after k = E done. => dist will store the total distan...
by Hector_Hsu
Wed Aug 16, 2006 3:29 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17378

hi , I read my program again and I found one thing . does your execution maintain dis(i,i)=0 ? Yes , I used a matrix to store the graph and set all graph [j] = 0 So if there is no input about house I to house J , the distance between them will be zero.(not connected) -------------------------------...
by Hector_Hsu
Wed Aug 16, 2006 11:55 am
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17378

My prog outputs the same..

any other inputs~? plz >"<
by Hector_Hsu
Wed Aug 16, 2006 11:25 am
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17378

11015 - 05-2 Rendezvous

I tried to solve this problem with Dijkstra's Algorithm N times. (I know there is a better way.... but I just try it...) But WA so many times, can anyone send me some critical test cases? I've read the previous posts already. btw, Will the following output appears? 3 1 Hector John Ray 2 3 1 ---> It ...
by Hector_Hsu
Wed Feb 01, 2006 8:02 am
Forum: Volume 5 (500-599)
Topic: 514 - Rails
Replies: 79
Views: 25821

514 - Rails : why WA?

My algorithm is to create a "stack" , and required permutation stored in a array named "permutation" After input, I check number 1 to N in a for loop if number i entered now and the permutation need him now, the permutation index changes to the next index and check if there are other can be pop from...
by Hector_Hsu
Wed Jul 06, 2005 5:07 pm
Forum: Volume 102 (10200-10299)
Topic: 10213 - How Many Pieces of Land ?
Replies: 54
Views: 23226

Just Ans = 1 + C(n,2) + C(n,4) -> 1 + n*(n-1)/2 + n*(n-1)*(n-2)*(n-3)/24 ------ We can observe and get it. When n = 1 , ans = 1; 1 is the original area. When n = 2 , ans = 2; We have two points so get 1 line.Just add 1 more area. When n = 3 , ans = 4; We have three points so get 3 lines,Just add 3 m...
by Hector_Hsu
Sun Jun 26, 2005 4:27 pm
Forum: Volume 105 (10500-10599)
Topic: 10566 - Crossed Ladders
Replies: 39
Views: 12122

Got AC.

The judge is too tricky......

even a unknown float mistake can cause (WA)^n

~"~
by Hector_Hsu
Sun Jun 26, 2005 9:48 am
Forum: Volume 105 (10500-10599)
Topic: 10566 - Crossed Ladders
Replies: 39
Views: 12122

10566 - Crossed Ladders WA 30 times , HELP /_______________\

Here is the code /*Use b-search,or the bisection method to find the answer*/ #include<cstdio> #include<cmath> using namespace std; double x,y,c,s,func,U,D,e,f; int main(void) { while(scanf("%lf%lf%lf",&x,&y,&c)==3) { if(x==y&&c!=0) { s = sqrt(x*x-4*c*c); printf("%.3lf\n",s); } else if(c==0) { printf...
by Hector_Hsu
Sat May 28, 2005 3:14 am
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18928

Sorry,

the title is find the "bug" , not the "big" |||

/________________________\
by Hector_Hsu
Sat May 28, 2005 3:12 am
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18928

412 - Pi

Here is my code Will some function like sqrt() make errors or I miss any part here? Please tell me , thanks a lot. ^^ #include<cstdio> #include<cmath> using namespace std; int prime=0; int judge(int a,int b); int main(void) { int N,n[50]; double pi; while(scanf("%d",&N)==1) { if(N==0) return 0; for(...

Go to advanced search