## Search found 15 matches

Mon Oct 17, 2011 9:30 am
Forum: Volume 120 (12000-12099)
Topic: 12024 - Hats
Replies: 5
Views: 3111

### Re: 12024

Mon Sep 13, 2010 7:05 pm
Forum: Volume 117 (11700-11799)
Topic: 11790 - Murcia's Skyline
Replies: 28
Views: 14192

### Re: 11790 - Murcia's Skyline

hellow arifcsecu ... thankz for the reply, i solved that problem already, can u discuss about this problem using 0log(n) algorithm i.e using binary search for LIS/LDS can u find all the possible sub-sequence in the whole sequence .... i could only derive the longest one (which is actually common !!!...
Sat Aug 28, 2010 1:46 pm
Forum: Volume 104 (10400-10499)
Topic: 10452 - Marcus
Replies: 21
Views: 9592

### Re: 10452 - Marcus, help!

hlw vahid sanei ...... you asked for the recursive code ..... :D please others don't just go through the code .... otherwise u will loose the interest of solving .... :wink: can please share how u tracked the given path in BFS ???? #include<cstdio> #include<cstring> #include<iostream> using namespac...
Wed Aug 25, 2010 12:26 am
Forum: Volume 110 (11000-11099)
Topic: 11064 - Number Theory
Replies: 25
Views: 16209

### Re: 11064 - Number Theory

hey xtremedreamer !!!!!

check this out http://www.topcoder.com/tc?module=Stati ... imeNumbers ......
I guess u will find sth usefull. Or u may have already solved ....
Enjoy coding

Anis
Thu Aug 19, 2010 1:20 pm
Forum: Volume 111 (11100-11199)
Topic: 11100 - The Trip, 2007
Replies: 18
Views: 13918

### Re: 11100 - The Trip, 2007

Hlw ...... This problem bugged me a lot ..... at got finally accepted after many try and now at ranked 7 :D ..... btw notedown this things 1. take the input ... for (long cs = 1; scanf("%ld", &n) == 1 && n > 0; cs++) { take_input(); process ..... } 2. print blank line between cases, except last. che...
Sun Aug 08, 2010 1:41 pm
Forum: Volume 117 (11700-11799)
Topic: 11790 - Murcia's Skyline
Replies: 28
Views: 14192

### Re: 11790 - Murcia's Skyline

hey " suneast " dats ok .......
Happy Coding ........
Fri Aug 06, 2010 9:18 pm
Forum: Volume 117 (11700-11799)
Topic: 11790 - Murcia's Skyline
Replies: 28
Views: 14192

### Re: 11790 - Murcia's Skyline

hlw ....... I thought this are the common terms in the algorithm, as i often see + hear the people expressing in this shortcut forms, and i guess abbreviation form is not really the SMS form, as SOHEL brother mentioned... anywayz i will try to rewrite my statement what i wrote earlier with explanati...
Thu Aug 05, 2010 5:51 am
Forum: Volume 117 (11700-11799)
Topic: 11790 - Murcia's Skyline
Replies: 28
Views: 14192

### Re: 11790 - Murcia's Skyline

hlw ol, frm the problem i could figure out that it is weighted lis/lds. Guyz cn any1 cn help me how to handle the weight along with lis. I mean what was ur approach. Thankz in advance
Tue Aug 03, 2010 4:09 am
Forum: Volume 117 (11700-11799)
Topic: 11799 - Horror Dash
Replies: 13
Views: 4901

### Re: 11799 - Horror Dash

hello rahid ..... It is written in the problem statement => 1 . However, to keep the audience on the edge of their seats, the clown must not run too fast either ....... 2. Given the speed of every scary creature, you are to find out the minimum speed that the clown must maintain so as not to get cau...
Tue Aug 03, 2010 4:02 am
Forum: Volume 117 (11700-11799)
Topic: 11718 - Fantasy of a Summation
Replies: 2
Views: 2690

### Re: 11718 - Fantasy of a Summation

use repeated squaring algorithm instead of pow ........
hope it helps ....

Anis
Sun Aug 01, 2010 8:24 pm
Forum: Volume 117 (11700-11799)
Topic: 11710 - Expensive subway
Replies: 14
Views: 5658

### Re: 11710 - Expensive subway

I guess this forum is not about posting the code, it is about just sharing ur views and ideas, ur bugs ........ please remove the code, and giver other the opportunity of thinking ........ rather then just copying ......

Anis
Sun Aug 01, 2010 8:21 pm
Forum: Volume 117 (11700-11799)
Topic: 11799 - Horror Dash
Replies: 13
Views: 4901

### Re: 11799 - Horror Dash

U dont even need an array .............

Anis
Fri Jul 30, 2010 7:49 pm
Forum: Volume 117 (11700-11799)
Topic: 11703 - sqrt log sin
Replies: 4
Views: 4489

### Re: 11703 - Sqrt Log Sin

hlw monty nthing to worry about precision just simulate how they told ex. do the recursion as like this, this we remove the precision.... a = recurr( long(i) - sqrt(double(i) ) ); b = recurr( log(double(i) ) ); c = recurr( double(i) * sin( double(i) ) * sin( double(i) ) ); try to implement with memo...
Thu Jul 29, 2010 10:33 pm
Forum: Volume 117 (11700-11799)
Topic: 11733 - Airports
Replies: 23
Views: 7494

### Re: 11733 - Airports

Thankz a lot zobayer ......... what kind of shit i m, didnt give proper concentration in that para, i think i should b more carefull....... nwayz just added this line in my code and got accepted nthing else changed :D if(G[i].wt < weight) // blah blah blah ...... Hey buddy thankz again, was stuck in...
Fri Jul 16, 2010 3:58 pm
Forum: Volume 117 (11700-11799)
Topic: 11733 - Airports
Replies: 23
Views: 7494

### Help in understanding 11733 - Airports

Hi, i m having difficulty in understanding the theme of this problem, at first i thought it can b solved by using kruskal and union find... but the sample i/o given below is not fitting to my logic... 5 2 100 1 3 20 3 5 100 here there are link between 1 -> 3 -> 5 so i consider it whole as 1, there a...