I have been unable to solve the question in this image. the most concerning part is k can be as large as 10^14 which doesn't give much options how to traverse and apply the logic. Please provide me a good approach to solve this

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

1 | tourist | 3947 |

2 | jiangly | 3740 |

3 | Radewoosh | 3652 |

4 | Benq | 3626 |

5 | jqdai0815 | 3620 |

6 | orzdevinwang | 3612 |

7 | ecnerwala | 3587 |

8 | Geothermal | 3569 |

8 | cnnfls_csy | 3569 |

10 | ksun48 | 3485 |

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

1 | awoo | 162 |

2 | maomao90 | 160 |

3 | adamant | 156 |

4 | atcoder_official | 155 |

5 | cry | 152 |

5 | maroonrk | 152 |

7 | nor | 150 |

8 | SecondThread | 148 |

8 | -is-this-fft- | 148 |

10 | Petr | 147 |

How to solve this question ? Here n<=10^5 and k<=10^14

Revision en1, by Ryuma_7810, 2024-04-07 19:16:25

I have been unable to solve the question in this image. the most concerning part is k can be as large as 10^14 which doesn't give much options how to traverse and apply the logic. Please provide me a good approach to solve this

Revisions

Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|

en2 | Ryuma_7810 | 2024-04-07 19:17:19 | 838 | |||

en1 | Ryuma_7810 | 2024-04-07 19:16:25 | 281 | Initial revision (published) |

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/13/2024 11:40:12 (l1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|