2003 Centrobasket

This page shows the results of the Men's Central American and Caribbean Basketball Championship, also known as the 2003 Centrobasket, which was held in the city of Culiacán, Mexico from June 17 to June 22, 2003.

Competing nations
Group A Group B

 Antigua and Barbuda
 Costa Rica
 Mexico
 Virgin Islands

 Bahamas
 Dominican Republic
 Guatemala
 Puerto Rico

Preliminary round
Group A Pts Pld W L PF PA Diff
 Mexico 6330288242+46
 Virgin Islands 5321280224+56
 Costa Rica 4312234274–40
 Antigua and Barbuda 3303224286–62
  • 2003-06-17
Virgin Islands  98 – 66  Costa Rica
Mexico  104 – 74  Antigua and Barbuda
  • 2003-06-18
Costa Rica  91 – 84  Antigua and Barbuda
Mexico  92 – 91  Virgin Islands
  • 2003-06-19
Mexico  92 – 77  Costa Rica
Virgin Islands  91 – 66  Antigua and Barbuda



Group B Pts Pld W L PF PA Diff
 Puerto Rico 6330307187+120
 Dominican Republic 5321226246–20
 Bahamas 4312260255+5
 Guatemala 3303185290–105
  • 2003-06-17
Dominican Republic  81 – 67  Guatemala
Puerto Rico  109 – 70  Bahamas
  • 2003-06-18
Bahamas  83 – 85  Dominican Republic
Guatemala  57 – 102  Puerto Rico
  • 2003-06-19
Bahamas  107 – 61  Guatemala
Dominican Republic  60 – 96  Puerto Rico

Second round
  • 2003-06-20 — 5th/8th place
Costa Rica  65 – 70  Guatemala
Bahamas  95 – 71  Antigua and Barbuda
  • 2003-06-20 — 1st/4th place
Mexico  93 – 94  Dominican Republic
Puerto Rico  87 – 86  Virgin Islands

Final round
  • 2003-06-21 — 7th/8th place
Costa Rica  86 – 99  Antigua and Barbuda
  • 2003-06-21 — 5th/6th place
Guatemala  60 – 81  Bahamas
  • 2003-06-21 — 3rd/4th place
Mexico  78 – 76  Virgin Islands
  • 2003-06-21 — 1st/2nd place
Dominican Republic  83 – 93  Puerto Rico

Final ranking
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.