Dancesport at the 2005 World Games – Standard
The standard competition in dancesport at the 2005 World Games took place on 17 July 2005 at the König Pilsener Arena in Oberhausen, Germany.[1]
Dancesport standard at the 2005 World Games | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
Venue | König Pilsener Arena | |||||||||
Location | ![]() | |||||||||
Date | 17 July 2001 | |||||||||
Competitors | 48 from 23 nations | |||||||||
Medalists | ||||||||||
| ||||||||||
Competition format
A total of 24 pairs entered the competition. Best eleven pairs from round one qualifies directly to the semifinal. In redance additional five pairs qualifies to the semifinal. From semifinal the best six pairs qualifies to the final.
Results
Rank | Athletes | Nation | Round 1 | Redance | Semifinal | Final |
---|---|---|---|---|---|---|
![]() | Arūnas Bižokas/Edita Daniūtė | ![]() | Q | Q | 1 | |
![]() | Sascha Karabey/Natascha Karabey | ![]() | Q | Q | 2 | |
![]() | Paolo Bosco/Silvia Pitton | ![]() | Q | Q | 3 | |
4 | Maxim Kotlov/Elena Uspenskaia | ![]() | Q | Q | 4 | |
5 | Andrzej Sadecki/Karina Nawrot | ![]() | Q | Q | 5 | |
6 | Miša Cigoj/Anastazija Novozilova | ![]() | Q | Q | 6 | |
7 | Andrej Mosejcuk/Susanne Miscenko | ![]() | Q | |||
8 | Ivan Zderciuk/Olga Ciubari | ![]() | Q | |||
9 | Andrej Hromádka/Aneta Orosiova | ![]() | Q | |||
10 | Valdis Škutāns/Laura Kosite | ![]() | Q | |||
11 | Csaba László/Szilvia Szögi | ![]() | Q | |||
12 | Masayuki Ishihara/Megumi Saito | ![]() | Q | |||
13 | Martin Dvořák/Zuzana Sihanova | ![]() | Q | |||
13 | Dmytro Vlokh/Olga Uromova | ![]() | Q | |||
15 | Florian Gschaider/Manuela Stöckl | ![]() | Q | |||
16 | Aleksander Makarov/Katrin End | ![]() | Q | |||
17 | Alexandre Chalkevitch/Larisa Kerbel | ![]() | ||||
18 | Matthew Rooke/Anna Longmore | ![]() | ||||
18 | Sami Vainionpää/Merje Styff | ![]() | ||||
20 | Isaac Rovira/Desiree Martin | ![]() | ||||
21 | Eric Chao/Cherry Kao | ![]() | ||||
21 | Philipp Porter/Kerri Porter | ![]() | ||||
21 | Regardt Van der Merwe/Lana Isaacks | ![]() | ||||
21 | Andrew Tate/Michelle Tate | ![]() |
gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
gollark: I'm unlikely to have stupidly large autocrafting trees.
gollark: As long as it doesn't take more than a second it fits within my performance goals.
gollark: RandomTwentyLineAlgorithmIWrote.
References
- "Results". www.web.archive.org. Retrieved 2020-06-25.
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.