== include(page="template/noprofile") ==

==userwidget(user="Razvan48")==
 

h2. Despre mine

* Data de nastere: 24 ianuarie 2003
* Cont pe CodeForces: https://codeforces.com/profile/Razvan48
* Cont pe LeetCode: https://leetcode.com/Razvan48
* Cont pe GitHub: https://github.com/Razvan48
* Cont pe LinkedIn: https://www.linkedin.com/in/r%C4%83zvan-nicolae-c%C4%83p%C4%83%C8%9B%C3%AEn%C4%83-a57888260

* Data de nastere: 24 Ianuarie 2003
* Cont CodeForces: https://codeforces.com/profile/Razvan48
* Cont LeetCode: https://leetcode.com/Razvan48
* Cont GitHub: https://github.com/Razvan48
* Cont LinkedIn: https://www.linkedin.com/in/razvan-capatina

* Am absolvit Colegiul National "Bogdan Petriceicu Hasdeu", Buzau (2018-2022)

* Student la FMI UniBuc, sectia Informatica, seria de olimpici (2022-)

* Student la Facultatea de Matematica si Informatica, Universitatea din Bucuresti, sectia Informatica, seria de olimpici (2022-2025)
* Software Engineer Intern la Microsoft (Bucuresti, vara 2024)

h2. Distinctii primite

* Calificare ONI 2020 si ONF 2020 (nu s-au mai tinut) (clasa a X-a)
* Participare ONI 2021 (clasa a XI-a)
* Participare ONI 2022 (clasa a XII-a)

* Alte premii si mentiuni la concursuri judetene si interjudetene de informatica, fizica, matematica

* Alte premii si mentiuni la concursuri judetene si interjudetene de Informatica, Fizica si Matematica

h2. Prieteni pe infoarena

* Celestin-Andrei Negraru: https://www.infoarena.ro/utilizator/Celestin

* == User(user = "thewildnath" type = "normal")==
* == User(user = "Adela_Petre" type = "normal")==
* == User(user = "Celestin" type = "normal")==
* == User(user = "sebimih" type = "normal")==
* == User(user = "UnknownPercentage" type = "normal")==
* == User(user = "Ilie_Mity" type = "normal")==
* == User(user = "Giulian617" type = "normal")==

h2. Proiecte personale (https://github.com/Razvan48)

* Un brute-force A.I. de sah (C++) (Am folosit algoritmi precum Minimax Algorithm, Alpha-Beta Pruning, Position Hashing, Zobrist Hashing.)

* Un brute-force A.I. de sah (C++) (Am folosit algoritmi precum MinMax Algorithm, Alpha-Beta Pruning, Position Hashing, Zobrist Hashing.)

* Un brute-force A.I. de X si 0 (C++) (sunt asa de putine configuratii posibile ale tablei de X si 0 incat pot fi precalculate toate raspunsurile si apoi programul raspunde in O(1) la fiecare mutare, folosind o functie de hash).
* Un voxel game (C++, OpenGL)
* Diverse jocuri 2D (C++, Python impreuna cu PyGame, OpenGL)