mkagenius's blog

By mkagenius, 9 years ago, In English
T(n) = 2*T(n/2) + n*log(n) 

I tried to solve it using master method but it doesn't seem to fit any of the three cases.
Am I correct.?

Read more »

 
 
 
 
  • Vote: I like it
  • -17
  • Vote: I do not like it

By mkagenius, 9 years ago, In English
http://en.wikipedia.org/wiki/Eight_queens_puzzle#Sample_program

Here the program for 8 - queen puzzle.
But it is not working.
Plz tell what is the problem.


Here I tried to run it:

Earlier there was no 'x' in wikipedia I added 'x' there...
Am I correct and still it is not working.

PS:  I don't know pascal, so plz don't get me on this. :)

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By mkagenius, 10 years ago, In English

when will it start?

India time and Moscow time.

Read more »

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

By mkagenius, 10 years ago, In English

Why I m getting "that bug message of cockroach or smthing...saying your bugs are mine" when i try to open blog of happy new  year (1040)...

..   for other blogs it is  okay...

and when I m not login then also okay........@admin plz check.


Read more »

Tags bug
 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By mkagenius, 10 years ago, In English
All those guys in top 10, I know your previous handles, I may take them,and then you may not be able to get it back so so so  So beware.  :P ;)

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By mkagenius, 10 years ago, In English

How to save my Laptop from ants?

I don't do any food-work on my laptop, even then, I don,t know what they like about it!

Read more »

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it

By mkagenius, 10 years ago, In English
One day Mirko, while he was walking through the high grass, stumbled upon a sequence of N colored marbles. Soon he noticed that if he touches K or more consecutive marbles of the same color, they start to twinkle and then he could wish them to magically vanish, although he doesn't have to do that immediately (see 2. sample). Fortunately, Mirko brought an inexhaustible supply of marbles from home, so he can insert a marble of any color
anywhere in the array (at the beginning, between any two existing marbles, or at the end). Help Mirko find the smallest number of marbles he must insert into the sequence before he could make all of the marbles vanish
Input

The first line of input contains two integers N (1 ≤ N ≤ 100) and K (2 ≤ K ≤5) - the number of marbles in the initial sequence and the minimal number of consecutive marbles of the same color he could wish to vanish. The next line contains exactly N integers between 1 and 100 (inclusive),separated by one space. Those numbers represent colors of marbles in the sequence Mirko found.
Output

The output should contain only one line with a single integer number - the minimal number of marbles Mirko has to insert to achive the desired effect.
Example
Input:
2 5
1 1
Output:
3

Input
10 4

3 3 3 3 2 3 1 1 1 3

Output:
4

HOW TO SOLVE THIS PROBLEM?

Read more »

Tags dp
 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it