Interview with Beihang University Li Jiancheng: I and the programming competition

Objective:

In the process of interview with Jerome, he always emphasized that he was an ordinary student, and he could not compare with Dr. Cao Peng, he was interviewed to discuss with more students. I believe that a student in various activities can achieve excellent results, must be in spare time to pay a lot of time to practice and review, a lot of brush questions and read technical books. "Tiandaochouqin", although talent is important, but more inseparable from diligence and efforts. Li Jiancheng thinks he has achieved, more through efforts to pay.

Jerome , a senior student majoring in software engineering at Beihang University. In addition to normal class learning, actively participate in extracurricular competitions, in the competition activities continue to learn and grow. Won the ACM-ICPC International University Program Design Competition Asian Regional competition silver medal, 2012 Microsoft Elite Big Challenge Third prize.

CSDN University Club: in the University club membership standings We see that your name (lijiancheng0614) topped the list, to surpass the second 200 points of the result is far ahead. You have successfully challenged most of the topics and are leizhu of many topics. You are still among the top candidates for the CCF Computer software Competency certification exam, which ended in September 2014. How do you stand out among the many competitors?

Li Jiancheng: usually more learning algorithm to do more problems, do more related to the competition of the site, to participate in the school's ACM competition training. CCF topics mainly examine basic data structures and programming languages, algorithms, and programming and debugging capabilities. It is not particularly difficult for students who participate in the ACM contest.

CSDN College Club: Some students think that programming is needed talent, no talent after the day even if the effort will be less. Many people do not see the relationship between mathematics, data structures, and computer-related courses, and it is unclear that they can play a complementary role. What do you think of the relationship between these disciplines? Do you think it is possible to improve the programming level in the competition?

Li Jiancheng: These are the two problems.

First, to learn mathematics, programming and algorithmic learning is helpful, these three are not contradictory. Learn about a course where there is a need to query and learn about another course.

Second, many schools have a programming competition platform. Participating in these competitions can help you improve your level, meet certain needs (work GPA, etc.), and sometimes prize money. Some games may be for college students only, but there seems to be no special need.

CSDN University Club: College Club online Programming practice topics, you are basically challenged to pass, and still some of the topics of Leizhu. Share the types of algorithms that are commonly explored in these topics? Do you think these topics will be helpful to the development of the project and the way of thinking?

Li Jiancheng:"The algorithm of the University Club online exercises Common investigation has ' simulation ', ' search ', ' dynamic programming ', ' greedy ', ' Graph theory correlation algorithm ', ' Number theory correlation algorithm ' and so on. Mastering this kind of algorithm for project development is practical help, can start faster, better understanding, and many projects also involve data structure and algorithm application. The way of thinking cultivated in algorithm learning is helpful to solve the real problems, such as the planning of many things, may need to use the idea of the algorithm to solve. The ' enumeration algorithm ' may be used when encountering difficulties.

CSDN College Club: A lot of freshman, sophomore study C and Java students, the first to the University club to do the problem, the system input and output do not understand. You still don't know how to answer after reading the Help document. Do you have any suggestions for this situation?

Li Jiancheng: read the Help document carefully, there is no understanding of the place can ask others . Slow down and study hard. From my own learning process, we recommend these books for your reference:

1) Thomas h.cormen, Charles E.leiserson, "Introduction to Algorithms", or Pan Jingui, Gu Tiecheng and other translation of the "Introduction to the algorithm"

2) Rujia, Huang Liang "algorithm Art and Informatics contest"

3) Richard A.brualdi, "introductory combinatorics", or "combinatorial mathematics", Feng Sun

4) "The beauty of Programming", compiled by the group "beauty of Programming"

Interview &ly flowing body: CSDN University Club Http://student.csdn.net

If you have a recommended interviewer, please send an email to [email protected] for manuscripts.

Interview with Beihang University Li Jiancheng: I and the programming competition