Over the years, the ACM Gangster - Interview with Chen Songyang

Copyright: ban does not indicate the source of reprint! https://blog.csdn.net/wangfang011/article/details/88763577

Author: Comet OJ ( cometoj.com ) operations meow

Here Insert Picture Description

Some questions had to do more than their own will not do so forced himself to learn what they will not.

- Chen Songyang

Today's share is 2018 CCPC-Wannafly Winter Camp instructor, ACM Gangster Chensong Yang.

Comet OJ:

Hello, Chen, I was the center of mass education Comet OJ ( http://cometoj.com ) operations manager, thank you for a guest interview education Comet OJ centroid. I ask you to introduce yourself, right ~

Chensong Yang:

I Chensong Yang from Hangzhou University of Electronic Science and Technology, I participated in two world finals overall.

Comet OJ:

What is your participation in this camp set up the original intention?

Chensong Yang:

The lecture came here, the original intention is to give everyone a chance to upgrade their increased knowledge we learn of some of the algorithms.

Comet OJ:

What do you think the significance of the game is to carry out or winter camp?

Chensong Yang:

Meaning if there are two: First, we can improve the level of knowledge; the other can put them together in simulated real atmosphere of the game. In this case, we will be training more meaningful.

Comet OJ:

Do you think CCPC-Wannafly Winter Camp and other camps learning algorithm What is the difference?

Chensong Yang:

The biggest difference is that it is free, so we will not because of economic problems would choose not to, in order to better help you.

Comet OJ:

Do you have any good ideas for programming and algorithms to enhance literacy can share?

Chensong Yang:

Experience is more to do some of the questions do not already own, thus forcing themselves to learn what they will not, so the level can be improved.

Comet OJ:

The Camp you have any interesting phenomenon discovered it?

Chensong Yang:

Interesting phenomenon is that some problems it is actually not difficult, but if the standings are not many people through, then we would not have to try, it is very common inside the usual race.

This phenomenon is not very good, we need to discover some of the topics themselves, however, will do, in fact, the Camp Some of the questions are not difficult, we do not take autism as a mantra, this is not the reason you do not learn.

Comet OJ:

You then is how the contest into a pit?

Chensong Yang:

When I was in high school I would have learned such programming game, so when he started high school.

Comet OJ:

Do you think their own learning algorithms and teach others what's the difference?

Chensong Yang:

The biggest game and participate in various lectures are: lectures you want to pass on what they learn to speak, to stand in everyone's point of view to think, how can we understand.

Interview Date: January 2019

We learned that Chen Songyang future will choose to graduate school, and we wish him to a successful career in academia, but also hope that he can continue to make greater contributions to China's education algorithm ~

The competition invites:

March 31, 2019, Comet OJ sponsored Comet OJ Contest # 0, the algorithm lovers are welcome to participate -
first prize: T-shirts and Japanese Cherry G80-3000 mechanical keyboard, there is a certain percentage of reward after the second skirt ~
is expected to match the scale of thousands of people - over
six questions, three hours.
Difficulty: equivalent ATcoder AGC difficulty.
And the general algorithm for ACMer enthusiasts.
The topic of people: ACM a big brother.
Test questions by: Chensong Yang, Claris, Hangzhou University of Electronic Science and Technology senior, ICPC World Finals players; Huang Xin, chitanda, Beijing University of Aeronautics and Astronautics senior, ICPC World Finals players.
Please enter a dynamic game: https://cometoj.com/contests

Or additive group: 775,445,676.

Well, share some OI / ACM chiefs of course, we want to help:

Div1-Day8 thematic graph theory (Xu wide)
Div1-Day7 thematic dynamic programming (Hong Huadun)
Div1-Day5 thematic dynamic programming (Chensong Yang)
Div1-Day4 thematic data structure (Wu as where)
Div1-Day3 topic Computational Geometry (Kyrgyzstan as one)
Div1- Day2 topic number theory (Tangjing Zhe)
Div2-Day4 solution to a problem (Wal-teacher)
Div2-Day4 solution to a problem (Wal-teacher)

Where algorithm discussions go? Big brother Meng wait for you to join a new group, OIer, ACMer together Hey ah ↓
group number: 775 445 676
into the OJ Comet ( zhixincode.com ), learning Shi Han Yuan, Xu wide, Hong Huadui, Du Yu Hao, Chen Songyang, as Wu Fan, Kyrgyzstan thematic and replay live programs as one solution to a problem, Tangjing Zhe and other chiefs, covering graph theory, dynamic programming, computational geometry, data structures, number theory and other modules -

Guess you like

Origin blog.csdn.net/wangfang011/article/details/88763577