These slimy garden dwellers really know how to have fun !
http://www.funnyshows.net/?id=60
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@goo
Feng, how can form a triangle in four dimensions???
2007/5/29, BiGYaN <[EMAIL PROTECTED]>:
>
>
> Just test whether they are collinear or not i.e. get the slopes,
>
> m1 from 1st and 2nd point
> m2 from 2nd and 3rd point
>
> if m1==m2 then they do not form a triangle
> else they do
>
> Comput
Hi friends ..i m trying to solve problem
http://online-judge.uva.es/p/v3/301.html .Although i understood the problem
but not getting any clear idea about algorithm . I guess that it would be
recursive and i am trying to implement recursion using stack as i am not
easy with recursion but not gett
What I am trying to do is given a string, find the sets of identical
substrings within the string (of a certain minimum length).
Examples:
in "abracadabra", we have 2 occurrences of "abra"
in "humpty dumpty", we have 2 occurrences of "umpty"
in "How much wood would a woodchuck chuck if a woodchuc
Ok...
here is the rough idea.
Since the two X's in two different sequences are treated as different X's, i
guess you subscript it with the sequence no as in Xa and Xb etc.
This needs to be done only with nodes that occur in a cycle. That cycle can
be removed if we consider the two Xs as differen
i am sry... i meant topological sort n not search.
and i think tht shud be the solution to ur problem.
i will try n post the solution asap.
bbye
On 5/30/07, Edward <[EMAIL PROTECTED]> wrote:
>
>
> I'm not sure what a topological search is, I understand a topological
> sort.
>
> AFAIK a topologi
I'm not sure what a topological search is, I understand a topological
sort.
AFAIK a topological sort is not a solution to my problem since it does
not work if there are cycles.
I'm not sure how I can be clearer with the problem, I can give another
example.
Given one sequence where
a) V ->
Hi
you problem is not very clear. But as far as i get it, it is somewhat like
topological search.
jus see what toplogical search is and chk if tht is wat u want.
if not plz give a clearer picture of the prob.
all the best
bbye
On 5/30/07, Edward <[EMAIL PROTECTED]> wrote:
>
>
> I'm afraid I
I'm afraid I don't really know the correct teminology do describe this
problem, so I'm having trouble looking for generalised solutions.
I have a set of sequences of points I must traverse in order and and I
want to combine the set into one long sequence possibly with some
points repeated so that
Hi there,
This problem is from: http://acm.pku.edu.cn/JudgeOnline/problem?id=1742
I got TLE and don't know how to optimize it. Can anybody help me out?
The following is my code:
#include
#include
#include
#include
#include
using namespace std;
const int MAX_N = 101;
const int MAX_
You can logon to Arena after the registration and go to the Practice
Room to do the exercise.
BTW, http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=archive
is the match editorial which may help you if you encounter hard
problems.
Happy coding :-)
On May 30, 6:25 pm, mirchi <[EM
but in top coder , can u tell me where i can find the problems ?
please give the link to the problem set..
On May 30, 3:14 pm, mirchi <[EMAIL PROTECTED]> wrote:
> thank you !
>
> On May 30, 2:18 pm, Chandrasekhar <[EMAIL PROTECTED]> wrote:
>
> > try registering on top coder.
>
> > they have probl
thank you !
On May 30, 2:18 pm, Chandrasekhar <[EMAIL PROTECTED]> wrote:
> try registering on top coder.
>
> they have problems categorised. you can find quite a few dynamic problems
> there...
>
> all the best
>
> --
> Chandrasekhar
> Final Year CSE
> NIT Allahabad
--~--~-~--~~
try registering on top coder.
they have problems categorised. you can find quite a few dynamic problems
there...
all the best
--
Chandrasekhar
Final Year CSE
NIT Allahabad
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
can any one recommend a gud website for for problems on dynamic
programming..where i can solve problems and submit it to know whether
it is correct or not..
i know one site acm.uva.es ?
can anyone tell me some other site ???
--~--~-~--~~~---~--~~
You received this
Hey,
As Bala suggested, at the simplest solution complexity seems to be O(n^2), I
don't understand how is any other solution described here is better then
O(n^2)!
Regards
On 5/22/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
>
> yes, you are right.
>
> On 5月21日, 下午1时56分, Ray <[EMAIL PROTEC
16 matches
Mail list logo
