Cristian Sánchez Prette

Cristian Nicolás Sánchez Prette (born 10 May 1985 in Río Cuarto) is an Argentine professional footballer, who plays as a midfielder.[7][8][9][10][11]

Cristian Sánchez Prette
Personal information
Full name Cristian Nicolás Sánchez Prette
Date of birth (1985-05-10) May 10, 1985
Place of birth Río Cuarto, Argentina
Height 1.75 m (5 ft 9 in)
Playing position(s) Midfielder
Youth career
Huracán
Senior career*
Years Team Apps (Gls)
2003–2008 Huracán 115 (13)
2008–2012 CFR Cluj 2 (0)
2009Estudiantes (loan) 12 (1)
2009–2010Newell's Old Boys (loan) 18 (1)
2010 → Barcelona SC (loan) 13 (0)
2011Argentinos Juniors (loan) 5 (0)
2011–2013Huracán (loan) 33 (1)
2014 CD Águila 12 (6)
2015 Tiro Federal 0 (0)
2015 Estudiantes de Río Cuarto 18 (2)
2016–2017 Berazategui[1] 7 (1)
2018 CD Audaz[2][3][4][5] 8[6] (2)
* Senior club appearances and goals counted for the domestic league only

Career

Sánchez Prette came through the Club Atlético Huracán youth system to make his first team debut in 2003. He was part of the squad that obtained promotion to the Argentine First Division, and in the Apertura 2007 tournament he contributed a useful four goals, helping Huracán to finish in 7th place.

In May 2008 he agreed terms with Romanian club CFR Cluj for a fee of 1.100.000 euro, but returned to Argentina in January 2009 to join Estudiantes de La Plata on loan.

Sánchez Prette scored a number of significant goals for Estudiantes including 2 goals to help them qualify for the knockout phase of Copa Libertadores 2009 and a 94th-minute equaliser against local rivals Gimnasia y Esgrima de La Plata in the Clásico Platense. He was also part of the Copa Libertadores winning team despite not playing the final game against Cruzeiro.

During the winter transfer window CFR Cluj loaned Sánchez Prette to Newell's Old Boys. In July 2010, Sánchez Prette was signed by Barcelona on a one-year loan.[12]

Honours

Estudiantes de La Plata

gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
gollark: Perhaps it is also possible to construct some sort of regex/deterministic finite automaton to match things matching anagramatically.

References


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