2012 Penza Cup – Singles
Arnau Brugués-Davi was the defending champion but decided not to participate.
Illya Marchenko won the tournament by defeating Evgeny Donskoy 7–5, 6–3 in the final.
Singles | |
---|---|
2012 Penza Cup | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 7–5, 6–3 |
Seeds
Alexander Kudryavtsev (First Round, retired because of a right elbow injury) Evgeny Donskoy (Semifinals) Konstantin Kravchuk (Semifinals) Yuki Bhambri (Quarterfinals) Kamil Čapkovič (Quarterfinals) Denys Molchanov (Quarterfinals) Evgeny Kirillov (Semifinals) Andrey Kumantsov (Second Round)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Finals
Semifinals | Final | ||||||||||||
![]() | 67 | 6 | 6 | ||||||||||
3 | ![]() | 7 | 4 | 2 | |||||||||
![]() | 7 | 6 | |||||||||||
2 | ![]() | 5 | 3 | ||||||||||
7 | ![]() | 2 | 64 | ||||||||||
2 | ![]() | 6 | 7 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 0r | |||||||||||||||||||||||||
Q | ![]() | 2 | Q | ![]() | 5 | 0 | |||||||||||||||||||||
![]() | 6 | 4 | 6 | ![]() | 7 | 6 | |||||||||||||||||||||
WC | ![]() | 4 | 6 | 3 | ![]() | 6 | 66 | 5 | |||||||||||||||||||
![]() | 2 | 6 | 64 | ![]() | 4 | 78 | 7 | ||||||||||||||||||||
![]() | 6 | 1 | 77 | ![]() | 6 | 6 | |||||||||||||||||||||
Q | ![]() | 5 | 3 | 8 | ![]() | 4 | 3 | ||||||||||||||||||||
8 | ![]() | 7 | 6 | ![]() | 67 | 6 | 6 | ||||||||||||||||||||
3 | ![]() | 2 | 713 | 6 | 3 | ![]() | 7 | 4 | 2 | ||||||||||||||||||
![]() | 6 | 611 | 4 | 3 | ![]() | 6 | 6 | ||||||||||||||||||||
Q | ![]() | 3 | 2 | ![]() | 2 | 1 | |||||||||||||||||||||
![]() | 6 | 6 | 3 | ![]() | 6 | 7 | |||||||||||||||||||||
WC | ![]() | 3 | 4 | 6 | ![]() | 3 | 5 | ||||||||||||||||||||
![]() | 6 | 6 | ![]() | 3 | 4 | ||||||||||||||||||||||
![]() | 5 | 0 | 6 | ![]() | 6 | 6 | |||||||||||||||||||||
6 | ![]() | 7 | 6 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
7 | ![]() | 3 | |||||||||||||||||||||||||
![]() | 0r | 7 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 2 | 6 | 7 | ![]() | 3 | 3 | |||||||||||||||||||||
Q | ![]() | 6 | 2 | 5 | 7 | ![]() | 3 | 6 | 6 | ||||||||||||||||||
![]() | 6 | 6 | 4 | ![]() | 6 | 1 | 3 | ||||||||||||||||||||
WC | ![]() | 3 | 1 | ![]() | 2 | 1 | |||||||||||||||||||||
![]() | 2 | 3 | 4 | ![]() | 6 | 6 | |||||||||||||||||||||
4 | ![]() | 6 | 6 | 7 | ![]() | 2 | 64 | ||||||||||||||||||||
5 | ![]() | 5 | 6 | 6 | 2 | ![]() | 6 | 7 | |||||||||||||||||||
![]() | 7 | 4 | 0 | 5 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 77 | 6 | ![]() | 5 | 0 | ||||||||||||||||||||||
Alt | ![]() | 65 | 3 | 5 | ![]() | 3 | 1 | ||||||||||||||||||||
![]() | 3 | 1 | 2 | ![]() | 6 | 6 | |||||||||||||||||||||
Alt | ![]() | 6 | 6 | Alt | ![]() | 5 | 4 | ||||||||||||||||||||
WC | ![]() | 3 | 4 | 2 | ![]() | 7 | 6 | ||||||||||||||||||||
2 | ![]() | 6 | 6 |
gollark: > 5. .net platform is cracker / hacker friendly Any program running on the client can INEVITABLY be reverse-engineered. Do not rely on it not experiencing that, because you will fail.
gollark: > 4. XAML - the incredibly messy UI technologyPerhaps, but this is not a *language* thing.
gollark: > 3. Garbage collector and memory leak detection tools?Again, not sure if anyone actually runs into this sort of issue in practice.
gollark: > 1. Performance penalties.> [some rambling about C++].NET is generally pretty much *fast enough*. If your application somehow hits performance bottlenecks, rewrite the slow bits in native code, don't just immediately take a development speed hit.> 2. Need to interoperate with C++ / Native (Windows) API’sI don't know how often you actually need to bind to a native API not wrapped by .NET or a third-party library, but you can do it, it's just annoying - but probably less than using C++ for everything!
gollark: This is outrageous pro-C++ anti-C# propaganda.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.