I need some good problems on stars and bars variants if anybody knows some catalogue of problems please do share.

Unfortunately, due to network issues, we are forced to reschedule the round. Let's do it in the coming days. Apologize.
×

# | User | Rating |
---|---|---|

1 | Benq | 3783 |

2 | jiangly | 3772 |

3 | tourist | 3706 |

4 | maroonrk | 3609 |

5 | Um_nik | 3591 |

6 | fantasy | 3526 |

7 | ko_osaga | 3500 |

8 | inaFSTream | 3477 |

9 | cnnfls_csy | 3427 |

10 | zh0ukangyang | 3423 |

# | User | Contrib. |
---|---|---|

1 | Um_nik | 183 |

2 | awoo | 180 |

3 | nor | 172 |

3 | -is-this-fft- | 172 |

5 | adamant | 170 |

6 | maroonrk | 165 |

7 | antontrygubO_o | 161 |

8 | SecondThread | 159 |

9 | dario2994 | 152 |

9 | kostka | 152 |

I was given the assignment problem related to finding chromatic number of the graph and i was able to write a solution at that time,but i realised from my friend that it is an NP hard problem and i used "BFS" to just implement so i think it should fail at some test case, so can anybody help me finding the test case to prove it wrong!!

/*Here is the code*/

Regards!!

I just started with segment tree based problems but thinking about a lot on this question i just need a small hint or something to actually have a drive in this problem,can anybody just give me a hint how to approach this problem,

Thanks!!

This problem is bugging me for days now, Can anybody tell where i am going wrong, Here is my code

I am doing in O(N^3), which should pass the given test cases,

but still exceeds please do help!!!

The problem basically says given N amount of money which has to be given!! we need to find how much minimum coins we can give and the total value of those coins such that the extra amount given is minimum using n given denomination!!

Example:

1400 -> N 3 -> no of denominations 500 1000 2000

Output: 1500 2

My question is what are the overlapping subproblems here!!!

why memoized solution fails in this problem: Source //below is the given code

//can you help me spot some patterns to optimise it!!!

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/21/2023 01:02:35 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|