Hey every one. Here’s a task: Find the least value of n such that 999 * (52! ^ n) > 1000 * ((52! — 1) ^ n) Can you help?

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

1 | jiangly | 3860 |

2 | Benq | 3783 |

3 | maroonrk | 3627 |

4 | fantasy | 3526 |

5 | ko_osaga | 3500 |

6 | Um_nik | 3496 |

7 | tourist | 3487 |

8 | inaFSTream | 3477 |

9 | Radewoosh | 3437 |

10 | zh0ukangyang | 3423 |

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

1 | Um_nik | 185 |

2 | awoo | 182 |

3 | nor | 172 |

4 | -is-this-fft- | 169 |

4 | adamant | 169 |

6 | maroonrk | 165 |

7 | antontrygubO_o | 160 |

8 | SecondThread | 158 |

9 | dario2994 | 151 |

9 | kostka | 151 |

Hi. Here's my solution for the latest div3 problem D : https://codeforces.com/contest/1385/submission/87172064

can somebody please help why it gets TLE? I checked my solutions with some accepted ones and the idea was the same.

next codechef cookoff round collides with next topcoder srm round!

so what is it used for ? why not just one test case instead of lots of them ? does it make judgement easier ? in past this way of representing input was not common, so what happened ? if you know answer to my questions above please answer in the comments :)

Hi guys! Here’s a problem I’m the author of it (and I don’t know the solution!) You are given a weighted tree with n nodes such that the weight of the ith node is w[i]. In each step you will do the following : Chose 2 adjacent nodes with weights V1 and V2. Delete the edge between them and put one of them on the other. Then the weight of the new node will be V1 + V2 and the cost of this action will be V1 + V2 as well. Now you are supposed to have a node with 0 adjacent nodes. What is the minimum cost of it?

So if you were given a tree with 2 nodes with weights 5 and 7 then the minimum cost would be 12.

I’ve not set any constraints yet but do your best on it! O(n * n) is preferred ...

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/02/2023 12:52:18 (k2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|