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 | 3687 |

2 | ecnerwala | 3600 |

3 | Benq | 3503 |

4 | ksun48 | 3421 |

5 | Um_nik | 3412 |

6 | Radewoosh | 3382 |

7 | maroonrk | 3323 |

8 | Itst | 3239 |

9 | apiadu | 3238 |

10 | ko_osaga | 3232 |

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

1 | Errichto | 205 |

2 | SecondThread | 196 |

3 | Monogon | 194 |

4 | vovuh | 189 |

5 | Ashishgup | 187 |

6 | pikmike | 185 |

6 | Um_nik | 185 |

6 | antontrygubO_o | 185 |

9 | pashka | 170 |

10 | Radewoosh | 167 |

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 - Джон Сноу и его любимое число , 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-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/25/2020 14:25:09 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|