Fencing at the 1967 Summer Universiade
Fencing events were contested at the 1967 Summer Universiade in Tokyo, Japan.
Medal overview
Men's events
Event | Gold | Silver | Bronze |
---|---|---|---|
Individual Foil | ![]() |
![]() |
![]() |
Team Foil | ![]() |
![]() |
![]() |
Individual Épée | ![]() |
![]() |
![]() |
Team Épée | ![]() |
![]() |
![]() |
Individual Sabre | ![]() |
![]() |
![]() |
Team Sabre | ![]() |
![]() |
![]() |
Women's events
Event | Gold | Silver | Bronze |
---|---|---|---|
Individual Foil | ![]() |
![]() |
![]() |
Medal table
Rank | Nation | Gold | Silver | Bronze | Total |
---|---|---|---|---|---|
1 | ![]() | 2 | 3 | 2 | 7 |
2 | ![]() | 2 | 0 | 0 | 2 |
3 | ![]() | 1 | 2 | 3 | 6 |
4 | ![]() | 1 | 1 | 1 | 3 |
5 | ![]() | 1 | 1 | 0 | 2 |
6 | ![]() | 0 | 0 | 1 | 1 |
Totals (6 nations) | 7 | 7 | 7 | 21 |
gollark: Anyway, single-precision floats can hold 2^32 values. Assuming you want to map each float to another float, you therefore only need 2^36 bytes of memory to store the lookup table.
gollark: I agree.
gollark: * of, even
gollark: We actually have enough RAM now that you could plausibly have a lookup table for all 32-bit floats.
gollark: This is because floats have a finite size, so there are finitely many possible floats.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.