2017–18 Biathlon World Cup – Stage 7
The 2017–18 Biathlon World Cup – Stage 7 was the 7th event[1] of the season and was held in Kontiolahti, Finland, from 8 March until 11 March 2018.
| 2017–18 Biathlon World Cup |
|---|
| Men |
| Women |
| Mixed |
| Mixed relay |
| World Cup stages |
| See also |
|
Schedule of events
| Date | Time | Events[1] |
|---|---|---|
| March 8 | 17:45 CET | Men's 10 km Sprint |
| March 9 | 17:45 CET | Women's 7.5 km Sprint |
| March 10 | 13:40 CET | 6 km + 7.5 km Single Mixed Relay |
| 16:45 CET | 2 × 6 km + 2 × 7.5 km Mixed Relay | |
| March 11 | 13:30 CET | Men's 15 km Mass Start |
| 16:10 CET | Women's 12.5 km Mass Start | |
Medal winners
Men
| Event: | Gold: | Time | Silver: | Time | Bronze: | Time |
| 10 km Sprint details |
Anton Shipulin | 23:51.6 (0+0) |
Andrejs Rastorgujevs | 23:57.4 (0+0) |
Quentin Fillon Maillet | 24:08.9 (0+0) |
| 15 km Mass Start details |
Julian Eberhard | 38:04.8 (0+0+1+1) |
Martin Fourcade | 38:11.7 (2+0+0+0) |
Anton Shipulin | 38:24.1 (0+1+0+0) |
Women
| Event: | Gold: | Time | Silver: | Time | Bronze: | Time |
| 7.5 km Sprint details |
Darya Domracheva | 20:56.8 (0+1) |
Franziska Hildebrand | 20:57.3 (0+0) |
Lisa Vittozzi | 21:02.3 (0+1) |
| 12.5 km Mass Start details |
Vanessa Hinz | 35:47.9 (0+0+0+0) |
Lisa Vittozzi | 36:01.4 (0+0+0+1) |
Anaïs Chevalier | 36:04.7 (0+0+0+1) |
Mixed
| Event: | Gold: | Time | Silver: | Time | Bronze: | Time |
| 6 km + 7.5 km Single Mixed Relay details |
Anaïs Chevalier Antonin Guigonnat | 33:29.1 (0+1) (0+2) (0+1) (0+0) (0+0) (0+0) (0+2) (0+0) |
Lisa Hauser Julian Eberhard | 33:31.5 (0+2) (0+1) (0+1) (0+0) (0+0) (0+1) (0+2) (0+0) |
 Marte Olsbu Johannes Thingnes Bø | 33:33.5 (0+2) (0+2) (0+0) (0+1) (1+3) (0+0) (0+2) (0+1) |
| 2 × 6 km + 2 × 7.5 km Mixed Relay details |
Dorothea Wierer Lisa Vittozzi Dominik Windisch Lukas Hofer | 1:15:08.3 (0+3) (0+3) (0+1) (1+3) (0+2) (0+0) (0+0) (0+1) |
 Anastasiya Merkushyna Vita Semerenko Artem Pryma Dmytro Pidruchnyi | 1:15:09.8 (0+0) (0+0) (0+1) (0+0) (0+1) (0+0) (0+0) (0+1) |
Synnøve Solemdal Tiril Eckhoff Henrik L'Abee-Lund Tarjei Bø | 1:15:17.4 (0+1) (0+2) (0+1) (0+3) (0+1) (0+0) (0+0) (0+1) |
Achievements
- Best performance for all time
|
|
|
gollark: > `import hashlib`Hashlib is still important!> `for entry, ubq323 in {**globals(), **__builtins__, **sys.__dict__, **locals(), CONSTANT: Entry()}.items():`Iterate over a bunch of things. I think only the builtins and globals are actually used.The stuff under here using `blake2s` stuff is actually written to be ridiculously unportable, to hinder analysis. This caused issues when trying to run it, so I had to hackily patch in the `/local` thing a few minutes before the deadline.> `for PyObject in gc.get_objects():`When I found out that you could iterate over all objects ever, this had to be incorporated somehow. This actually just looks for some random `os` function, and when it finds it loads the obfuscated code.> `F, G, H, I = typing(lookup[7]), typing(lookup[8]), __import__("functools"), lambda h, i, *a: F(G(h, i))`This is just a convoluted way to define `enumerate(range))` in one nice function.> `print(len(lookup), lookup[3], typing(lookup[3])) #`This is what actually loads the obfuscated stuff. I think.> `class iｎt(typing(lookup[0])):`Here we subclass `complex`. `complex` is used for 2D coordinates within the thing, so I added some helper methods, such as `__iter__`, allowing unpacking of complex numbers into real and imaginary parts, `abs`, which generates a complex number a+ai, and `ℝ`, which provvides the floored real parts of two things.> `class Mаtrix:`This is where the magic happens. It actually uses unicode homoglyphs again, for purposes.> `self = typing("dab7d4733079c8be454e64192ce9d20a91571da25fc443249fc0be859b227e5d")`> `rows = gc`I forgot what exactly the `typing` call is looking up, but these aren't used for anything but making the fake type annotations work.> `def __init__(rows: self, self: rows):`This slightly nonidiomatic function simply initializes the matrix's internals from the 2D array used for inputs.> `if 1 > (typing(lookup[1]) in dir(self)):`A convoluted way to get whether something has `__iter__` or not.
gollark: If you guess randomly the chance of getting none right is 35%ish.
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.
References
- "Event schedule". IBU Datacentre at datacenter.biathlonresults.com. International Biathlon Union. Retrieved 9 March 2018.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.