Next question would be "How many of us, WFranc has PMed to?"
:D
Printable View
Next question would be "How many of us, WFranc has PMed to?"
:D
That's a difficult one. :DQuote:
Originally posted by CBasicNet
Next question would be "How many of us, WFranc has PMed to?"
:D
Okay let me post a real question (a killer)
So you have corridor (we can look at it as a coordinate system) with x-size X and y-size Y (X>Y>1). In the corridor there are N traps (a trap is a point) given by x and y coordinates. A fat man (or a circle) needs to pass from the one end of the corridor to the other. He mustn't touch the traps (so if the fat-man (circle) has radius R the distance between his center and a trap cannot be less than R but it can be R). Question is: If you have X,Y N and N coordinates (all numbers are integers) ot traps how to find the maximal radius that the fat man can have.
ex N is 0 than the fat man's radius can be maximally Y/2...
so I don't need an answer because there can't be such without actaually having the input numbers. I need a valid solution to the problem writen in steps. (Algorithm for a program)
Write an algorithm that calculates the distance between all combinations of two traps and that calculates the distance between each trap and the boundaries. The radius is equal to the shortest distance divided by two.Quote:
Originally posted by SeventhStar
Okay let me post a real question (a killer)
So you have corridor (we can look at it as a coordinate system) with x-size X and y-size Y (X>Y>1). In the corridor there are N traps (a trap is a point) given by x and y coordinates. A fat man (or a circle) needs to pass from the one end of the corridor to the other. He mustn't touch the traps (so if the fat-man (circle) has radius R the distance between his center and a trap cannot be less than R but it can be R). Question is: If you have X,Y N and N coordinates (all numbers are integers) ot traps how to find the maximal radius that the fat man can have.
ex N is 0 than the fat man's radius can be maximally Y/2...
so I don't need an answer because there can't be such without actaually having the input numbers. I need a valid solution to the problem writen in steps. (Algorithm for a program)
Simon666
Oh well, Mr Simon666, what you said here seemed to prove that you are the guy who always walks with the head down and your feet up in the air. Or I can express in a different way: Come out with feet first. YOU DID send me or did I ,a_h ?
MR CBASICNET,Quote:
Most of us who post in CodeGuru, are working adults and you should realise by now, most of them have a degree. However, when we are posting in the General Discussion forum(Chit-chat), we automatically 'shift' into our pseudo-self which seem to be very funny characters, actually most of us here are very serious people when it comes to work.
Yes, I have realized that already since the time I joined the forums not NOW.
Let me ask you some questions, Do YOU or anybody here have any self_introductions before posting something ? Why dont YOU use your real name instead of CBASICNET ?Did I say something to hurt or to insult anyone just like some of the guys here did to me in some of my previous posts ?
MR CBASICNET, What do you mean by ' most of the people here are working adults' ? Did I ever say you or anyone were a kid in my post till now ???? you did automatically 'shift' to prove that YOU ARE A WORKING ADULT with CHILDISH BEHAVIORS, didn't you ? Oh, let me say one thing which I have learnt from someone in here:If a clown has 5 apples, I'll take 2. But in this case, I took 3, one to eat, one to laugh, one to send you an PM to share with the Guy the fun I had when I was still in CA. I did not care about whether you sent me a PM back or not but I knew you lied to me about it. Thatz it.
You donot have to say hope that I willnot do this or that, I send PM only to those I like and I think those will be not like some of the liars or bast@rds I met.
By the way, I would like to tell some of those guys here again that if YOU disagreed with something I wrote in my posts, let me know directly and right away. Insulting just proves you to have a disgusting rude behavior and that YOU are nothing but a LOSER, lose for ME. YOU could not argue for your opinions to convince me and people and YOU turned to insult, is it right ? WHAT AN ADULT YOU ARE !!! If I were you I should have felt so much ashamed of myself. YOU ! so proud of WHO YOU ARE and what you are possessing, YOU turn to be SELFISH or maybe this is YOUR NATURE !!! I absolutely know and admit that YOU are much well informed about life and perhaps have very good educations but unfortunately what you did shew you werenot deserving for any respects from me about your success indeed. This is what I would like to tell some of the guys who did insult me before. Hope you will take these words as reminds. I am not teaching YOU anything here as YOU KNOW SO MUCH ABOUT THEORY about life, BUT it is now true that YOU COULDNOT BRING IT INTO PRACTICE, and because I don't want to be thought 'student outgrows teacher'.
Quote:
Next question would be "How many of us, WFranc has PMed to?"
The next question will be 'Do you guys have any comments on what I wrote here ? I repeat if any, let me know, teach me right from wrong, or correct the mistakes I made. Anything ? I appreciate your help !!!'Quote:
That's a difficult one.
It is not difficult really, it is up to your tongue, MR SIMON666 !!! :D
Yep. But as far as I know, a private message is a private message, nomatter what its content is. Sending it around to other people shows little respect and can be proof of bad intentions.Quote:
Originally posted by Wfranc
YOU DID send me or did I ,a_h ?
I don't know about CBasicNet but if you want my real name, look at my profile and go to my website. My name is just too long to use as nick. Why people choose to have a nick other than their real name is supposed to be nobody's business, and as I've been told too, using some other person's avatar than your own picture is apparently also.Quote:
Originally posted by Wfranc
Why dont YOU use your real name instead of CBASICNET ?
How about using "I HATE YOU GABRIEL FLESH" as location? I have had issues with Gabriel but I don't hate him or spread hate.Quote:
Originally posted by Wfranc
Did I say something to hurt or to insult anyone just like some of the guys here did to me in some of my previous posts ?
Depending on your use of language and other indicators, I also assumed you are a kid too. And what is the stuff aboutthe apples? You're not clear in most of what you write. I think solarflare intended to make fun of the fact that asking trivial questions is pointless, and I thought it was a good joke. Why do you see it as an insult?Quote:
Originally posted by Wfranc
MR CBASICNET, What do you mean by ' most of the people here are working adults' ? Did I ever say you or anyone were a kid in my post till now ????
Quote:
Originally posted by Wfranc
[Senseless rambling nobody understands what it is about, where it came from and where it is going to.]
Simon666:
Yes, PM is PM :D. But 'no matter what the content' is an unaceptable phrase. Why ???... You have to answer yourself !?!
What I wrote in my post didnot directly aim at anyone but YOU and CBasicNet. And moreover, I didnot say Solarflare insulted me in her/his posts. Are you trying to make the 'war' flame burn more between me and SolarFlare ? Or are you crying out for help from others when you seemed to lose in this nice argument ? what a shame !!!
About the fact I used that statement as my location some time ago: Do you need any explanation about the difference between 'hate' and 'insult' ? Can you spell the words ? That was the private problem between me and MR Fleseriu which there was also some guy secretly trying to poke his nose in.
What you are trying to list up here is just to provoke other people hatre towards me, I know that, Sim. But you must know for sure that people here are not kids to be that easily provoked. If you want a fair play and you think you can win, I am always here to wait for you:) !!!
If you want peace, stop it from now on.
I think you have to think twice before you post the reply in order that I could call you an adult.
One more thing, I donot need YOU to understand the whole things I wrote in my post, what I wrote about YOU could be understood by you was my intention. And that is enough for your part. Thanks !!!
My real name is Bob Lim as stated in the readme file inside my screensaver.zipQuote:
Originally posted by WFranc
Why dont YOU use your real name instead of CBASICNET ?
If I had wanted to insult you, I would have said "most of the people here are not kids" insteads.:D Please note I did not say you are a kid. I have also never say you said anyone was a kid.Quote:
Originally posted by WFranc
Did I say something to hurt or to insult anyone just like some of the guys here did to me in some of my previous posts ?
MR CBASICNET, What do you mean by ' most of the people here are working adults' ? Did I ever say you or anyone were a kid in my post till now ????
No I did not lie to you; I did not really go to the URL you pm'ed me. Since you are so adamant, well I can say "I did visit the site you sent me." to you, just to humor you. :eek:Quote:
Originally posted by WFranc
I did not care about whether you sent me a PM back or not but I knew you lied to me about it.
I have a feeling that arguing with you, brings me down to your level.
I have to remind you that this thread belongs to the SeventhStar. If this thread dis-integrate into flaming, this thread may get locked, which many do not like to see this happen, especially SeventhStar.
, did I say you said I was a kid ?Quote:
Please note I did not say you are a kid
But now I think you have to explain what you meant by this: 'I have a feeling that arguing with you, brings me down to your level.'
Oh well, now it turns out to be truer about who you really are.Quote:
Since you are so adamant, well I can say "I did visit the site you sent me." to you, just to humor you.
Yes, I agree with you that this thread belongs to SeventhStar and I also would like to remind you that this thread is about 'questions and answers'. I did make some questions for you to answer did't I ?Quote:
If this thread dis-integrate into flaming, this thread may get locked, which many do not like to see this happen, especially SeventhStar.
Let me ask you :who is the first to start for this argument ? YOU, SIMON666 OR ME ?
You should remember that if you think you are old enough, you must say and do something much more right for anyone younger like me to pay some respects to.
If you said something wrong about not only me but anyone or anything, I think I 'd have the right to say it WRONG, no matter who you are, this is who I am. I very much hope that what I wrote here could be thoroughly understood. Thanks. :)
From myself
From WFrancQuote:
Please note I did not say you are a kid
That was not what I meant. Don't play around with semantics.Quote:
did I say you said I was a kid ?
From WFranc
Your statement before this statement explains it all.Quote:
But now I think you have to explain what you meant by this: 'I have a feeling that arguing with you, brings me down to your level.'
From WFranc
The one who typed in bold, started the flaming first.Quote:
Let me ask you :who is the first to start for this argument ?
From WFranc
In that case, then I must say you are rather uprighteous for standing up for anyone or anything. :DQuote:
If you said something wrong about not only me but anyone or anything, I think I 'd have the right to say it WRONG, no matter who you are, this is who I am.
Guys,
this flamewar ends right here. If you have some issues to clarify, do it by mail or PM. If you have a problem with a post, report that post.
I do not think Simon666's algorithm will actually discover the truest maximal size for the fat man, though it will definitely generate a fat man size that would work. Take for example a corridor of size 1 wide, z long (which any general corridor can be scaled to) with one trap at location (.2, z/2). Simon666's algorihm would give .1 as the maximal radius, when actually a man of radius .4 could squeeze through on the opposite side.Quote:
Originally posted by SeventhStar
Okay let me post a real question (a killer)
So you have corridor (we can look at it as a coordinate system) with x-size X and y-size Y (X>Y>1). In the corridor there are N traps (a trap is a point) given by x and y coordinates. A fat man (or a circle) needs to pass from the one end of the corridor to the other. He mustn't touch the traps (so if the fat-man (circle) has radius R the distance between his center and a trap cannot be less than R but it can be R). Question is: If you have X,Y N and N coordinates (all numbers are integers) ot traps how to find the maximal radius that the fat man can have.
ex N is 0 than the fat man's radius can be maximally Y/2...
so I don't need an answer because there can't be such without actaually having the input numbers. I need a valid solution to the problem writen in steps. (Algorithm for a program)
Therefore, I think the problem requires a little more work for an algorithm. I gave a similar algorithm in this thread, but I do not think this exactly applies to this problem. I think a better approach is that one calculates for each trap the maximum fat man radius needed to completely pass it (to get the last fold past the trap down the corridor, to graphically speak). This is done by calculating the distance from each trap to every other obstacle (trap or wall) and separating results into travelling pass-to-left and pass-to-right results. Minimize only to each side and pick the maximal side result. Then one calculates a path of traps around which one will touch (not all traps may be used in a path) using a search algorithm on the tree of possible path passingss to maximize the decision of whether to pass to the left or right of a trap in a given path. The most difficult part of this process will be to determine the tree of possible path passings, but I believe the problem can be decomposed into three-obstacle decisions. It seems a hard problem to me, but I guess you could use the fact that three points uniquely determine a circle that touches them (if not colinear -- which is a degenerate circle) and similarly, two points and a line (for a circle tangent to the line). This combined with the above minimax should give the connection criteria for the possible path tree tree.
A very difficult problem indeed! I can even see situations where it could be advantageous for a path to pass a trap on one side and backtrack slightly on the opposite side to pass obstacles ahead (not to the point of center going back in front of a trap, though). But I do not see a solution without a search on the possible path tree...
Its amazing how one second I will think a problem is particularly difficult, and shortly after posting so, I will figure it out. Its like going to ask the teacher for help, and after the question is asked, getting the epiphany and having to blurt out "oh never mind, I got it after all..." Happened all throughout my schooling.
This problem is actually a (very thinly) disguised problem that is used as the canonical use of complementary graphs and networks on them, and the answer is basically isomorphic. There are four basic steps to solving it.
- Start with the given problem. Draw it out as specified. Label the traps (a simple rule like T1, T2, ... works fine) and the left and right walls (WL, WR).
- Now for each trap, draw lines segments connecting it to each of the other traps and perpendicularly connecting it to each wall. If any of these line segments pass through another trap, only draw the line segment to that trap and not through the trap to the original target. At this point you have a graph with the traps and wall intersections as the vertices and the drawn segments and wall seegments as the edges. Label the regions formed on the plane (I use 1, 2, ... for simplicity). The special regions at the start and end of the corridor can be labelled "start" and "end".
- Now you draw the complementary graph to the one formed in the previous step. Each region becomes a vertex, and regions that share a bounding edge (not a point) are connected by edges. We turn this into a network by associating a weight to each edge, that weight being half the distance of the full drawn line segment of which the boundary is a subsegment (not just half the subsegment length).
- Finally, we apply a path traversal search algorithm to maximize the cost for the problem on paths that start at "start" and end at "end". The cost for this problem is cost(path) = min(edge(E)) where the minimization is over the edges of the given path. Finding the path that maximizes this cost gives the widest path a fat man could take, and the cost of that path is his radius.
I've attached a little jpeg that illustrates this for a sample with four traps. Any graph traversal enumerating algorithm can be used for the final step, or a more optimum algorithm like Dijkstra's can be used to perform the maximization (the standard form of Dijkstra is a minimization, so one can merely take the reciprocal weights). Anyways, it appears I should study more on network problems, because once the idea comes to draw the graph, it is amazing how closely this follows the canonical network cost-minimizing problem...
Well, my original picture was a bit too big, so I've decreased the jpeg quality and the dpi of the scan. I hope it is still possible to figure it out.
All right galathaea you got it!! :D ;)
There are 2 or 3 other solves (including mine which is different) but I like yours. You managed to 'standartize' (or something like that) the problem.
This problem was given at the Bulgarian National Programing Olympics and was solved only by eleven (out of 60) people (including me ;) ). You desereve the point :D
So will you ask a question or shall i proceed?
As for Simon: you didn't think the problem over very good this 'obvious' solve gives a possible but not optimal answer.