Тёмный
No video :(

Python HackerRank Solutions: Power - Mod Power 

nexTRIE
Подписаться 6 тыс.
Просмотров 213
50% 1

My Amazon store: www.amazon.com...
My GitHub: github.com/Isa...
Python solution for the HackerRank math question, Power - Mod Power, which is seemingly a continuation of the related problem called "Integers Come In All Sizes."
*As an Amazon affiliate, commissions are earned on purchases.
#hackerrank #python #maths

Опубликовано:

 

22 авг 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 2   
@RiversPPC
@RiversPPC 2 месяца назад
I didn’t understand anything!
@nextrie
@nextrie 2 месяца назад
Hey, let me explain to you more clearly. The pow() function in Python can take two or three arguments. With two arguments, say A and B, the statement pow(A, B) calculates A raised to the power of B. This is the same as writing A**B in Python. If you want to find A raised to the power of B, then take the result modulo C, you can use the three-argument version of the pow() function. The modulo operator (%) gives the remainder of a division. So, (A**B) % C first calculates A raised to the power of B and then finds the remainder when that result is divided by C. Instead of writing (A**B) % C, which can be slow for large numbers, you can use pow(A, B, C). This does the same calculation but more efficiently. Is it clearer now?
Далее
Python HackerRank Solutions: Capitalize!
7:52
What is Python's Main Function Useful For?
8:08
Просмотров 76 тыс.
Italians vs @BayashiTV_  SO CLOSE
00:30
Просмотров 4,2 млн
СЛАДКОЕЖКИ ПОЙМУТ😁@andrey.grechka
00:11
SHA: Secure Hashing Algorithm - Computerphile
10:21
Просмотров 1,2 млн
5 Useful F-String Tricks In Python
10:02
Просмотров 296 тыс.
25 Nooby Pandas Coding Mistakes You Should NEVER make.
11:30