## Search found 115 matches

Sat Sep 02, 2006 9:47 pm
Forum: Volume 110 (11000-11099)
Topic: 11078 - Open Credit System
Replies: 12
Views: 6199
Hi!! Martin

you are right , I have a bug in my code, thanks for that

Keep posting.
Sat Sep 02, 2006 6:05 pm
Forum: Volume 110 (11000-11099)
Topic: 11078 - Open Credit System
Replies: 12
Views: 6199

### 11078 - Open Credit System

Hi to all!

I getting WA in this one mi algo is:

if i < j then "i" is senior and j is junior
so I take the diference of S_i - Min ( S_J ) where i<j<=n

then take the maximun of this diferences

Fri Jul 07, 2006 3:05 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 26516
Hi !! yin_yang2k Is good see that your problem is fine, for the problems of the input in c++ I used a mix between C and C++ for the read input because I consider that C has better read and out that C++, sometimes is uncorfortable write cout<< and << and <<...... etc. but is a opinion very personal, ...
Thu Jul 06, 2006 8:42 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 26516
by the way your ouput is fine my program give the same answers

Hope it helps
Keep Posting
Thu Jul 06, 2006 8:39 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 26516
Hi !! yin_yang2k I will go to post mi algorithm for take the input cause the algorithm for get the answer is easy, is just take the components conex. int read_graph(graph *g) { int i,j,p,x,y,res1; char c[10],*res2;//this is for take the input initialize_graph(g);//fluhs the graph gets(c);//get the l...
Sun Feb 12, 2006 7:48 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 26516
Hi!! Oh Se Jun I post some tests cases in a previous post, did you saw that post ?
http://online-judge.uva.es/board/viewtopic.php?t=6354
Sat Dec 31, 2005 12:56 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14708
Hi ! daevon

Thanks !!!!!!!! gives me AC !! at last!!!!!!!!!!!! this problem make me mad because I didn't find the error, but with your algo I found, thanks again

Keep posting
Fri Dec 30, 2005 4:15 pm
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14708
Hi ! daveon thanks for your pront answer here are a seudo code commented about mi algo I hope that you understead the algo is very simple just iniciliation of arrays and then do dfs, int Deps[102]; Graph graph; int DFS(int v){ if(Deps[v] != -1) return Deps[v]; int sum = 0; // graph[v].size() give th...
Thu Dec 29, 2005 1:41 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14708
Hi ! daveon

I consider the whole graph but I seek for the best of the values for all the vertices, I think that the best values are from the vertices that have in-degrre = 0 so this vertices are considered in my algo

Keep posting
Wed Dec 28, 2005 2:34 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14708

### 10926 - How Many Dependencies?

Hi !!!! to all I stuck in this problem please help me I use DFS to count the value for every vertex. so I call DFS for every vertex, but I not count the same vertex twice.then I memorize every count for vertex that I used in DFS. finally when I count the value for all vertex , I find the maximum val...
Wed Sep 28, 2005 1:57 pm
Forum: Volume 100 (10000-10099)
Topic: 10068 - The Treasure Hunt
Replies: 31
Views: 6525
Hi!! I want to know some hints to solve this problem.
I see the problem has a problem of shortest path but repiting nodes, in the sample input they repeat some nodes in the path, please help me

keep posting
Wed Sep 21, 2005 8:41 pm
Forum: Algorithms
Topic: Isomorfics graphs
Replies: 3
Views: 1439
Thanks ".." for the link makes that the problem was more clear to me :D Thanks Adrian for the hint its really helpfull I did the problem 2935 from the judge of regionals. The part of the problem that still unsolved is graph in general how to see if two graph are equals, I say this because I want to ...
Fri Sep 09, 2005 1:04 pm
Forum: Algorithms
Topic: Isomorfics graphs
Replies: 3
Views: 1439

### Isomorfics graphs

Hi Everyone, I wanted to know everything about How to check if two given graphs are isomorfics.
If there one algo please post seudocode here or mail me, if there one link that can help me please post here, the proposite is implement one rutine for this problem

Fri Apr 29, 2005 11:37 pm
Forum: Volume 1 (100-199)
Topic: 190 - Circle Through Three Points
Replies: 126
Views: 23330
Hi emotional blind !! try with this input
in:

Code: Select all

5 5 4 7 16 5
out:

Code: Select all

(x - 10.500)^2 + (y - 9.000)^2 = 6.801^2
x^2 + y^2 - 21.000x - 18.000y + 145.000 = 0
Hope it helps
Keep posting !!
Tue Mar 22, 2005 12:29 am
Forum: Volume 101 (10100-10199)
Topic: 10191 - Longest Nap
Replies: 75
Views: 30061
Thanks to sumankar,misof and Krzysztof Duleba for their quick answers,and advice I solve the problem and Get WA but after somes tries AC The problems was #include <algorithm>