Vladislav Nikiforov
Vladislav Yuryevich Nikiforov (Russian: Владислав Юрьевич Никифоров; born 21 March 1989) is a Russian footballer. He plays for FC SKA-Khabarovsk.[1] He is versatile, he primarily plays as right midfielder, but can play on the left side as defender or winger.
 With SKA-Khabarovsk in 2017 | |||
| Personal information | |||
|---|---|---|---|
| Full name | Vladislav Yuryevich Nikiforov | ||
| Date of birth | 21 March 1989 | ||
| Place of birth | Vyazemsky, Russian SFSR | ||
| Height | 1.66 m (5 ft 5 1⁄2 in) | ||
| Playing position(s) | Midfielder/Defender/Forward | ||
| Club information | |||
Current team | FC SKA-Khabarovsk | ||
| Number | 10 | ||
| Youth career | |||
| FC SKA-Energiya Khabarovsk | |||
| Senior career* | |||
| Years | Team | Apps | (Gls) |
| 2006–2007 | FC SKA-Energiya Khabarovsk | 47 | (4) |
| 2008–2010 | FC Khimki | 27 | (0) |
| 2009–2010 | → FC SKA-Energiya Khabarovsk (loan) | 41 | (4) |
| 2011– | FC SKA-Khabarovsk | 281 | (17) |
| National team‡ | |||
| 2006 | Russia U-17 | 3 | (0) |
| 2008 | Russia U-19 | 5 | (1) |
| 2009 | Russia U-21 | 1 | (0) |
|
* Senior club appearances and goals counted for the domestic league only and correct as of 23 November 2019 ‡ National team caps and goals correct as of 12 August 2009 | |||
Club career
He made his Russian Premier League debut for FC Khimki on 15 March 2008 in a game against FC Amkar Perm.
Career statistics
- As of 4 March 2018
| Club | Season | League | Cup | Continental | Other | Total | ||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Division | Apps | Goals | Apps | Goals | Apps | Goals | Apps | Goals | Apps | Goals | ||
| SKA-Khabarovsk | 2006 | FNL | 21 | 3 | 1 | 0 | – | – | 22 | 3 | ||
| 2007 | 26 | 1 | 1 | 0 | – | – | 27 | 1 | ||||
| Khimki | 2008 | Russian Premier League | 19 | 0 | 1 | 1 | – | – | 20 | 1 | ||
| 2009 | 8 | 0 | 1 | 0 | – | – | 9 | 0 | ||||
| Total | 27 | 0 | 2 | 1 | 0 | 0 | 0 | 0 | 29 | 1 | ||
| SKA-Khabarovsk | 2009 | FNL | 11 | 0 | 0 | 0 | – | – | 11 | 0 | ||
| 2010 | 30 | 4 | 0 | 0 | – | – | 30 | 4 | ||||
| 2011–12 | 41 | 5 | 1 | 0 | – | – | 42 | 5 | ||||
| 2012–13 | 13 | 0 | 2 | 0 | – | 2[lower-alpha 1] | 0 | 17 | 0 | |||
| 2013–14 | 23 | 4 | 1 | 0 | – | – | 24 | 4 | ||||
| 2014–15 | 27 | 0 | 1 | 0 | – | – | 28 | 0 | ||||
| 2015–16 | 37 | 1 | 2 | 1 | – | – | 39 | 2 | ||||
| 2016–17 | 30 | 3 | 3 | 1 | – | 2[lower-alpha 2] | 0 | 35 | 4 | |||
| 2017–18 | Russian Premier League | 16 | 0 | 2 | 0 | – | – | 18 | 0 | |||
| Total (2 spells) | 275 | 21 | 14 | 2 | 0 | 0 | 4 | 0 | 293 | 23 | ||
| Career total | 302 | 21 | 16 | 3 | 0 | 0 | 4 | 0 | 322 | 24 | ||
Notes
- Two appearances in promotion play-offs
- Two appearances in promotion play-offs
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; if (bees[i1] == 0) { if (bees[i1] = 64) {} } bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); sort(q, 8); printf("%s", q);}```
gollark: Interesting.
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); sort(q, 8); printf("%s", q);}```
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.