There was a Problem in November cook off of codechef. This problem requires partition dp. I have known that partition dp is kind of masking. Can anyone suggest me some similar problems and from where I can learn this topic. Thanks

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

1 | tourist | 3707 |

2 | Benq | 3672 |

3 | Radewoosh | 3655 |

4 | ksun48 | 3547 |

5 | jiangly | 3492 |

6 | Miracle03 | 3480 |

7 | ecnerwala | 3400 |

8 | maroonrk | 3385 |

9 | peehs_moorhsum | 3384 |

10 | sunset | 3338 |

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

1 | 1-gon | 215 |

2 | Um_nik | 190 |

3 | YouKn0wWho | 188 |

4 | sus | 183 |

5 | awoo | 182 |

6 | Errichto | 179 |

7 | tourist | 177 |

8 | -is-this-fft- | 172 |

9 | Radewoosh | 170 |

10 | Ashishgup | 169 |

I have just known about google kickstart . I have noticed that it is said , Google may offer job or internship through google kickstart performance . But , how much well one has to perform to get this ? I meant anyone in this community got interview offer from this ? What rank you achieved ?

(sorry for bad English and thanks in advance)

For 768C - Jon Snow and his Favourite Number , what is the intuition to solve it ? At first for small constraint I made brute force solution and noticed that there is a pattern , there can be two different arrays — when k is even and when k is odd.

But this is not working . Here is my code .

In this UVA 10755 — Garbage Heap , we have to find maximum sum of any sub range.

I have seen the solution and editorial available online . But I don't understand the insight . How 2d max sum and kadane algorithm is applying to get the ans. I meant How it is working actually .

Anyone please help me with this problem

Here, you are asked to find second shortest path.

Given a graph with n nodes and m edges . n ≤ 100,000 and m ≤ 1,000,000 . We have to find any odd cycle.

How to solve this problem ? I tried in naive way. I just stored the nodes when I get any cycle of odd length . But it will obviously TLE.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/24/2021 17:40:31 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|