I hereby claim:
- I am paulnbrd on github.
- I am paulnbrd (https://keybase.io/paulnbrd) on keybase.
- I have a public key ASDdjx2KTOqOSjgagEqwRmLRR_jYYeBV7iKEeSJHD6bWLQo
To claim this, I am signing this object:
| 0x56b9ff21a5ca98bb2815b752dc6b35d2641de1d6 | |
| 0xc9880b42f0b92081b00e69553e82d9f157fad151 | |
| 0x0aac033fcc100a9939d51146ab7b1fd0a05e34f7 | |
| 0x0e0f0b61aa7d853243322e2c136c58fcfbe32e82 | |
| 0x9ace0434349bfd3e0af2f0a837740c0cae738404 | |
| 0xba27de794ebfb9b4c10b021aef9a6b850b2d2c43 | |
| 0x3d6d4f035ad8a68c98dedb60aa2377fa8809325e | |
| 0xe9ef3c283e7e00c9a688fc47d097de3aa5cd9456 | |
| 0x116b57248efdcfb1f36b827f1c1f1870b538af60 | 
| import time | |
| import matplotlib.pyplot as plt | |
| def diviseurs(n: int, positifs_uniquement: bool = False) -> list: | |
| """ Fonction pour récupérer tous les diviseurs d'un nombre """ | |
| assert type(n) is int | |
| if positifs_uniquement: | |
| return [i for i in range(1, n + 1) if n % i == 0] | |
| return [i for i in range(-n, n + 1) if i != 0 and n % i == 0] | 
| import pygame, sys | |
| pygame.init() | |
| import shadow | |
| polygons = [ | |
| ( | |
| (75, 150), | |
| (60, 175), | |
| (75, 350), | 
| import os | |
| try : | |
| import winreg | |
| except : | |
| print("You need winreg.") | |
| print("(pip install winregistry)") | |
| os._exit(0) | |
| REG_PATH = r"SOFTWARE\code-and-web.de\BabelEdit\licensing" | |
| def set_reg(name, value): | |
| try: | 
I hereby claim:
To claim this, I am signing this object: