This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| Problems: | |
| https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1 | |
| */ | |
| /* | |
| SAMPLE INPUT | |
| 1 | |
| 8 | |
| 5 4 7 1 2 8 9 10 |
v1k22
/ pollard_brent.py
Created
November 25, 2018 08:01
Comparison: Pollard vs. Brent Factorization algorithms
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| Bhavik Dhandhalya | |
| BITS Pilani, ME Computer Science batch 2020 | |
| """ | |
| from fractions import gcd | |
| from random import randint | |
| import time | |
| def f(x, c, n): | |
| return (x ** 2 + c) % n |
NewerOlder