You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.

MCM

Last visit:  11 years ago
Registered:  11 years ago
2.
Leetcode | Hard | Dynamic Programming | Help
By Utsav1998, history, 4 years ago, In English
Leetcode | Hard | Dynamic Programming | Help You wrote down many positive integers in a string called num. However, you realized that you forgot to add commas to seperate the different numbers. You remember that the list of integers was non-decreasing and that no integer had leading zeros. Return the number of possible lists of integers that you could have written down to get the string num. Since the answer may be large, return it modulo 109 + 7. Input: num = "327" Output: 2 Explanation: You could have written down the numbers: 3, 27 327 Input: num = "094" Output: 0 Explanation: No numbers can have leading zeros and all numbers must be positive. Input: num = "0" Output: 0 Explanation: No numbers can have leading zeros and all numbers must be positive. Constraints: 1 <= num.length <= 3500 num consists of digits '0' through '9'. Hi I have used mcm variation in this where i will traverse the depending on the condition wheather if i put comma then this particular string is equal or greater then prev...
digits '0' through '9'. Hi I have used mcm variation in this where i will traverse the, Hi I have used mcm variation in this where i will traverse the depending on the condition wheather

Full text and comments »

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

3.
Help with Matrix Chain Multiplication
By BabuRao, history, 7 years ago, In English
Help with Matrix Chain Multiplication I was reading about the matrix chain multiplication problem and came across an $O(N^2)$ solution on GeeksforGeeks.<br><br> The link to the same is [here](https://www.geeksforgeeks.org/matrix-chain-multiplication-a-on2-solution/)<br><br> However the blog had this note: Note : Below solution does not work for many cases. For example: for input {2, 40, 2, 40, 5}, the correct answer is 580 but this method returns 720.<br><br> So, I was wondering how accurate is the solution and do any questions of MCM require $O(N^2)$ optimization? Any help is appriciated.
of MCM require $O(N^2)$ optimization? Any help is appriciated., So, I was wondering how accurate is the solution and do any questions of MCM require $O(N^2

Full text and comments »

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

4.
Looking Problem[MCM]
By naeem4265, history, 6 years ago, In English
Looking Problem[MCM] Hi Programmers, recently i have learned **Matrix Chain Multiplication**. i have solved <spoiler summary="this problem"> https://www.spoj.com/problems/MIXTURES/ </spoiler> now i am looking forward some **problem** for practice... thank you
Looking Problem[MCM]

Full text and comments »

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

5.
PROBLEMS REQUIRED
By hiddenanonymous, history, 5 years ago, In English
PROBLEMS REQUIRED Can someone provide me some problems based on MCM type dp states or idea? I have solved this problem only : [https://www.spoj.com/problems/MIXTURES/](https://www.spoj.com/problems/MIXTURES/)
Can someone provide me some problems based on MCM type dp states or idea? I have solved this

Full text and comments »

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