"I tried to Find out success using binary search....But ended up realizing that my life is not sorted..."

Conclusion--->>>There are no shortcuts, do it the hardworking way

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

1 | tourist | 3851 |

2 | jiangly | 3634 |

3 | Um_nik | 3539 |

4 | slime | 3498 |

5 | ksun48 | 3493 |

6 | djq_cpp | 3486 |

7 | maroonrk | 3471 |

8 | Radewoosh | 3442 |

9 | Petr | 3426 |

10 | Isonan | 3344 |

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

1 | -is-this-fft- | 185 |

2 | awoo | 180 |

3 | dario2994 | 171 |

4 | SecondThread | 168 |

4 | maroonrk | 168 |

4 | Um_nik | 168 |

4 | adamant | 168 |

8 | YouKn0wWho | 166 |

8 | errorgorn | 166 |

10 | antontrygubO_o | 162 |

"I tried to Find out success using binary search....But ended up realizing that my life is not sorted..."

Conclusion--->>>There are no shortcuts, do it the hardworking way

↑

↓

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/27/2022 20:29:46 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

r/iam14andthisisdeep

sort(life.begin(),life.end());

problem solved

I tried to calculate my chance for success using dp...But ended up realizing that my life is cyclic.

Then Gaussian Elimination is coming into consideration.

How can you use Gaussian elimination to solve a DP where subproblems have cyclic dependency ?

Gaussian elimination is used to solve a system of linear equations. So ... how ?

Maybe I'm not getting your point. But as I know, in some probabilities dp problems, dp equations are something like: $$$dp[i] = \sum\limits _{j\text{ is adjacent to }i} a[i][j] * dp[j]$$$, where $$$a[i][j]$$$ is some sorts of coefficient. In such case, the dp equations do turn into linear equations. :)

but what if there are no solutions?

Then print F instead.

I tried applying dp but then I realized, everything is just stupid greedy

greedy : 561 math : 488 implementation : 388 dp : 327

i believe you. :D

I tried to find out the answer of life by representing it as $$$p \times q^{-1} (mod\,M)$$$ where $$$p$$$ and $$$q$$$ are coprime but I realized life doesn't have a prime modulo, neither is life even rational...

I thought past experience will help me in life but everyday is just addhoc

But when life starts to feel monotonic, you know what to do ;)

I tried to find the Shortest path to success using Dijkstra... But ended up realizing that my life is full of negative weight edges.

...so I used Bellman-Ford.