Tith Dina
Tith Dina (Khmer: ទិត្យ ឌីណា born 5 June 1993) is a Cambodian footballer who plays for the Visakha in the Cambodian League and also Cambodia national football team.[1] He made is only appearance for the 2014 World Cup Qualifying match against Laos on 3 July 2011.[2]
| Personal information | |||
|---|---|---|---|
| Full name | Tith Dina | ||
| Date of birth | June 5, 1993 | ||
| Place of birth | Phnom Penh, Cambodia | ||
| Playing position(s) | Midfielder | ||
| Club information | |||
Current team | Visakha | ||
| Number | 15 | ||
| Senior career* | |||
| Years | Team | Apps | (Gls) |
| 2008–2018 | National Police Commissary | ||
| 2018– | Visakha | 1 | (0) |
| National team | |||
| 2013–2015 | Cambodia U-23 | ||
| 2011– | Cambodia | 33 | (2) |
| * Senior club appearances and goals counted for the domestic league only | |||
Career statistics
International goals
On 28 July 2016, he scored the winning goal in a 2-1 victory over Singapore in front of a sell-out crowd at the Olympic Stadium in Phnom Penh. At the 45+1 minutes he found himself at the end of a brilliant pass from Chan Vathanaka and netted the game's second goal to record Cambodia's first win over Singapore since 1972.
Senior team
- Scores and results list Cambodia goal tally first.
| # | Date | Venue | Opponent | Score | Result | Competition |
|---|---|---|---|---|---|---|
| 1. | 28 July 2016 | Olympic Stadium, Phnom Penh |  | 2–1 | 2–1 | Friendly Match |
| 2. | 21 October 2016 | Olympic Stadium, Phnom Penh |  | 1–0 | 3–2 | 2016 AFF Championship qualification |
gollark: I don't think you can *in general*, but you'll probably know in some cases what the content might be. Lots of network protocols and such include checksums and headers and defined formats, which can be validated, and English text could be detected.
gollark: But having access to several orders of magnitude of computing power than exists on Earth, and quantum computers (which can break the hard problems involved in all widely used asymmetric stuff) would.
gollark: Like how in theory on arbitrarily big numbers the fastest way to do multiplication is with some insane thing involving lots of Fourier transforms, but on averagely sized numbers it isn't very helpful.
gollark: It's entirely possible that the P = NP thing could be entirely irrelevant to breaking encryption, actually, as it might not provide a faster/more computationally efficient algorithm for key sizes which are in use.
gollark: Well, that would be inconvenient.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.