2003 CAM Open Comunidad Valenciana – Singles

Gastón Gaudio was the defending champion but lost in the quarterfinals to Flávio Saretta.

Singles
2003 CAM Open Comunidad Valenciana
Champion Juan Carlos Ferrero
Runner-up Christophe Rochus
Final score6–2, 6–4

Juan Carlos Ferrero won in the final 6–2, 6–4 against Christophe Rochus.

Seeds

A champion seed is indicated in bold text while text in italics indicates the round in which that seed was eliminated.

  1. Juan Carlos Ferrero (Champion)
  2. Marat Safin (First Round)
  3. Àlex Corretja (First Round)
  4. Gastón Gaudio (Quarterfinals)
  5. Agustín Calleri (Quarterfinals)
  6. Mariano Zabaleta (First Round)
  7. José Acasuso (First Round)
  8. David Sánchez (Second Round)

Draw

Key
First Round Second Round Quarterfinals Semifinals Final
1 J C Ferrero 6 6  
WC G García-López 4 4   1 J C Ferrero 6 6  
  A Portas 6 6     A Portas 4 4  
  K Beck 2 2   1 J C Ferrero 6 6  
  D Hrbatý 7 4 7 5 A Calleri 3 4  
  M Norman 5 6 5   D Hrbatý 1 7 2
  I Kunitsyn 4 0   5 A Calleri 6 5 6
5 A Calleri 6 6   1 J C Ferrero 77 6  
4 G Gaudio 6 6     F Saretta 63 2  
  A Sá 1 1   4 G Gaudio 3 6 6
Q Á Calatrava 3 1     G Blanco 6 4 4
  G Blanco 6 6   4 G Gaudio 6 63 3
Q F Verdasco 67 0     F Saretta 4 77 6
Q F Čermák 79 6   Q F Čermák 63 4  
  F Saretta 6 6     F Saretta 77 6  
6 M Zabaleta 1 3   1 Juan Carlos Ferrero 6 6  
8 D Sánchez 3 6 6   Christophe Rochus 2 4  
Q O Patience 6 4 2 8 D Sánchez 4 3  
  A Martín 2 64     N Massú 6 6  
  N Massú 6 77     N Massú 3 4  
  F López 61 6 3   F Vicente 6 6  
  F Vicente 77 3 6   F Vicente 66 6 6
  A Dupuis 5 6 6   A Dupuis 78 1 3
WC/3 À Corretja 7 3 4   F Vicente 3 2  
7 J Acasuso 4 67     C Rochus 6 6  
  M Hipfl 6 79     M Hipfl 4 0  
  A Montañés 6 63 2   C Rochus 6 6  
  C Rochus 3 77 6   C Rochus 6 6  
  S Sargsian 6 6     S Sargsian 2 2  
  D Ferrer 4 1     S Sargsian 7 3 6
  F Squillari 6 5 6   F Squillari 5 6 3
WC/2 M Safin 4 7 2
gollark: I found the Prelude definition of iterate:```haskelliterate :: (a -> a) -> a -> [a]iterate f x = x : iterate f (f x)```
gollark: Huh?
gollark: If you want to define an infinitely recursive data structure, just make an infinitely recursive function.
gollark: Thanks to lazy evaluation, anything can be infinite!
gollark: *infinite lists
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.