1983 German Open
The 1983 German Open was a men's tennis tournament played on outdoor clay courts at Am Rothenbaum in Hamburg, West Germany that was part of the 1983 Grand Prix circuit. It was the 75th edition of the event and took place from 9 May through 14 May 1983. Sixth-seeded Yannick Noah won the singles title.
| 1983 German Open | |
|---|---|
| Date | 9–14 May |
| Edition | 75th |
| Category | Grand Prix |
| Draw | 56S / 28D |
| Prize money | $250,000 |
| Surface | Clay / outdoor |
| Location | Hamburg, West Germany |
| Venue | Am Rothenbaum |
| Champions | |
| Singles | |
 | |
| Doubles | |
  | |
Finals
Singles
- It was Noah's 2nd singles title of the year and the 13th of his career.
Doubles
.svg.png){kind=small}
gollark: Anyway, going through #12 in order:> `import math, collections, random, gc, hashlib, sys, hashlib, smtplib, importlib, os.path, itertools, hashlib`> `import hashlib`We need some libraries to work with. Hashlib is very important, so to be sure we have hashlib we make sure to keep importing it.> `ℤ = int`> `ℝ = float`> `Row = "__iter__"`Create some aliases for int and float to make it mildly more obfuscated. `Row` is not used directly in anywhere significant.> `lookup = [...]`These are a bunch of hashes used to look up globals/objects. Some of them are not actually used. There is deliberately a comma missing, because of weird python string concattey things.```pythondef aes256(x, X): import hashlib A = bytearray() for Α, Ҙ in zip(x, hashlib.shake_128(X).digest(x.__len__())): A.append(Α ^ Ҙ) import zlib, marshal, hashlib exec(marshal.loads(zlib.decompress(A)))```Obviously, this is not actual AES-256. It is abusing SHAKE-128's variable length digests to implement what is almost certainly an awful stream cipher. The arbitrary-length hash of our key, X, is XORed with the data. Finally, the result of this is decompressed, loaded (as a marshalled function, which is extremely unportable bytecode I believe), and executed. This is only used to load one piece of obfuscated code, which I may explain later.> `class Entry(ℝ):`This is also only used once, in `typing` below. Its `__init__` function implements Rule 110 in a weird and vaguely golfy way involving some sets and bit manipulation. It inherits from float, but I don't think this does much.> `#raise SystemExit(0)`I did this while debugging the rule 110 but I thought it would be fun to leave it in.> `def typing(CONSTANT: __import__("urllib3")):`This is an obfuscated way to look up objects and load our obfuscated code.> `return getattr(Entry, CONSTANT)`I had significant performance problems, so this incorporates a cache. This was cooler™️ than dicts.
gollark: The tiebreaker algorithm is vulnerable to any attack against Boris Johnson's Twitter account.
gollark: I can't actually shut them down, as they run on arbitrary google services.
gollark: Clearly, mgollark is sabotaging me.
gollark: I submitted them but they were all wrong.
References
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.