Euler fast power / Euclidean extension algorithm / Euler Fermat power reduction

The following contents are the knowledge of Elementary Mathematics catalogue Euler fast power Counting Euler fast power Euclidean (Extended) algorithm Euclidean algorithm Pei Shu theorem extended euclidean algorithm Euler Fermat power reduction Euler function Euler theorem   Euler extension theorem Euler fast power Count ...

Posted by loganbest on Wed, 08 Dec 2021 01:46:04 +0100

Mathematical knowledge: Euler function, fast power, extended Euclidean algorithm, Chinese remainder theorem

Euler function Solving Euler function by formula method Basic principle: O(n √ ai)     Example: Euler function given   n positive integers   ai, please find the Euler function of each number. Definition of Euler function 1 ∼ N and   N   The number of Coprime numbers is called the Euler function a ...

Posted by dirkie on Mon, 06 Dec 2021 05:44:18 +0100

[solution] Luogu-P4774 [NOI2018] Dragon Slayer

If you fight with a dragon for too long, you will become a dragon. If you stare at the abyss too long, the abyss will stare back. ​ —— Nietzsche's the other side of good and evil P4774 [NOI2018] Dragon Slayer \(\text{Description}\) Players need to kill \ (n \) dragons in the order of number \ (1 \to n \), ...

Posted by kobayashi_one on Fri, 03 Dec 2021 14:37:01 +0100

Noip simulation 85 2021.10.29 (to depression Trilogy)

preface Thanks to the author, I was directly depressed in the examination room Although I only saw Darling in the FRANXX, I still felt bad for \ (ichigo \) for a long time T1 \ ((ichigo) \) I came to see you dressed up like you like, Guang, no, da, darling Uncomfortable!!! But it's hard for me to cut \ (T1 \) without cutting it off On the exa ...

Posted by le007 on Fri, 29 Oct 2021 12:32:40 +0200

[solution] 2021 Niuke OI pre competition training camp - improvement group (Game 1)

A. In the optimal scheme a n s [ i ] [ j ] ≤ 17 ...

Posted by nikko50 on Wed, 06 Oct 2021 02:01:59 +0200

LeetCode 231.Power of Two is simple

This article belongs to "Conquer LeetCode"One of the series, which began officially in 2021/08/12. Because some of the titles on LeetCode are locked, this series will last at least until the day all the unlocked titles are brushed off. Because LeetCode is still creating new titles, the end date of this series may be forever. In this s ...

Posted by sendoh07 on Tue, 28 Sep 2021 18:04:40 +0200