In hindsight, I probably should not have spent this much time on a wrong algorithm.

Allow me to present *Constant Optimization on Binary Exponentiation and Matrix Multiplication*:

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

1 | tourist | 3880 |

2 | jiangly | 3669 |

3 | ecnerwala | 3654 |

4 | Benq | 3627 |

5 | orzdevinwang | 3612 |

6 | Geothermal | 3569 |

6 | cnnfls_csy | 3569 |

8 | jqdai0815 | 3532 |

9 | Radewoosh | 3522 |

10 | gyh20 | 3447 |

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

1 | awoo | 161 |

1 | maomao90 | 161 |

3 | adamant | 156 |

4 | maroonrk | 153 |

5 | -is-this-fft- | 148 |

5 | SecondThread | 148 |

7 | atcoder_official | 147 |

7 | Petr | 147 |

9 | nor | 144 |

10 | TheScrasse | 142 |

How to AC an n=1000 problem with O(n^3log n) algo

Revision en1, by Zhtluo, 2023-12-02 06:14:25

In hindsight, I probably should not have spent this much time on a wrong algorithm.

Allow me to present *Constant Optimization on Binary Exponentiation and Matrix Multiplication*:

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/25/2024 22:35:11 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|