Pavel Seliverstau

Pavel Vadimovich Seliverstau (Belarusian: Павел Вадзімавіч Селівёрстаў; born 2 September 1996) is a Belarusian track and field athlete who competes in the high jump. He holds a personal best of 2.32 m (7 ft 7 14 in), set indoors in 2017.[1] He was a bronze medallist at the 2017 European Athletics Indoor Championships and represented his country at the 2016 European Athletics Championships.

Pavel Seliverstau

Seliverstau in 2017
Medal record
Men's athletics
Representing  Belarus
European Indoor Championships
2017 BelgradeHigh jump

In his youth, he competed at the 2013 World Youth Championships in Athletics and the 2015 European Athletics Junior Championships.[2]

International competitions

Year Competition Venue Position Notes
2013 World Youth Championships Donetsk, Ukraine 17th (q) 2.07 m
2015 European Junior Championships Eskilstuna, Sweden 5th 2.17 m
2016 European Championships Amsterdam, Netherlands 19th (q) 2.19 m
2017 European Indoor Championships Belgrade, Serbia 3rd 2.27 m
European U23 Championships Bydgoszcz, Poland 5th 2.22 m
gollark: ```x86asm!PAD E0LOOP:re 8 RI # read target location from arbitrary side into bufferadd RJ RI !1mez RJ I !0 # if target location is 255, jump to 0 (normal thing start)re 8 RJ # read data into other bufferidm RI RJ # transfer data into specified locationmov I !LOOP # unconditional jump back to startRI: ! 0RJ: ! 0```Here is the bootloader code, loaded onto all new nodes by default to allow self-replication.
gollark: This means I can use the elegant MEZ and MNZ for flow control.
gollark: osmarksISA™-12847 has variable width instructions, arbitrary arithmetic stuff built in, no concept of immediate operands, and the program counter mapped in at location 0xFF in memory.
gollark: The ³ is because it's 3D, which it isn't.
gollark: You have an infinite 2D grid of nodes with 256 bytes of RAM and osmarksISA™-12847.

References

  1. Pavel Seliverstau. All-Athletics. Retrieved on 2017-03-11.
  2. Pavel Seliverstau. European Athletics. Retrieved on 2017-03-11.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.