"Turn" ACM summary _by Aekdycoin

Transferred from: Http://hi.baidu.com/aekdycoin/item/c5bd27f5834caf09d89e72d7

All the road in mainland China's 5 division after the end of a number of post-retirement posts, summed up, or merit perfection, or his grave, and this may be the next year to create a variety of "bomb corpse" storm. In order to consider in the post-retirement post next year I also become a "zombie" possibility, so renamed Yue "summary paste", do not mention the game details, do not mention the game journal, right when the university undergraduate career in the ACM Life of a bit record ...

(1) Introductory article A

PS: The following content is the product of Ctrl+a,c,v

==========================================================================================================

The notice on the wall downstairs of the dorm drew my attention ... Fuzhou University is the third Program design Contest registration Notice ... At that time, I still do not know what the game content on the silly newspaper, just think it is the use and debugging of the function of the test procedure. But I didn't think of the language I used ... vb/delphi,delphi and Pascal were too different, and I found out that the game could be in C. So opened the never opened the C language book began to learn ...
The process of learning is very difficult, for the last semester I did not listen to the class, for the previous object-oriented programming for me this is a nightmare.
Alas, the book is not easy to finish the problem or endless Wawawa at that time most want to see is: Accepted
I found a freshman to learn the feeling of VB, so in the students strange and puzzled I began to do the problem.
(Other students have not opened the network number.) So the number of people on the computer is relatively small, I do not play the game is very conspicuous.
A non-computer professional people all day in front of the computer, they all doubt whether I error the professional.


In a few days after the problem met the bull ... Thank him for guiding me in my introductory phase ...
Also know Yayamao, let me know the big cow people also many ...
The inferiority complex arises
At that time the face of so many people seems to be "water problem" problem, I can only be helpless again WA, tenacious wa ....
In the face of primary school on the provincial champion of the people, I can only be considered in the autumnal matron of the fearless struggle.

Many times want to give up, or Zhang comfort, gave me confidence ...
Finally bought his first algorithm book (Good expensive ...)
Suddenly found a large pile of can't understand ...
This time again Zhang gave me guidance.
Learn to take it slow
It seems that he said there is a reason, Baidu looked at him, cattle and cattle deeds countless ... orz ...


I began to go to the water problem under the Yayamao blow ... In fact, I do not have the title of 100.
It's still a big gap with Yayamao.
Orz...again ...


Finally, the registration was canceled, because I do not have the algorithm at all.



I do not believe that the latter can not live, I do not believe that God will not give the hard-working people a small chance. I believe in myself ... Can reach Yayamao 1% (joking-_-)

Feel this 1 months to harvest a lot, understand a little bit of a little bit of hair (not yet to the skin ...)


But I insist on that everything'll be better after hard work.
I think I will not regret after efforts, although the gap with the cattle are very big, but hope often in the future is unknown, I believe this point ...

I, a dish to no longer vegetable birds, looking up after the achievements of the predecessors of the power of suddenly feel, in the efforts of the predecessors of the results were written ...
The seniors are working hard, I think I will try harder. 90 packets of noodles can be tried (VB came here ...)


I can't say it anymore.
Everybody bless me, this rookie.
And I hope this post becomes a starting point for me.
With a later aftertaste

Finally thanks to the bull
Way
Orz.......yayamao

==========================================================================================================

(2) Introductory article B

09 Winter vacation met the Sha Cub
At that time he seemed to have just entered the HDU school team, seemed to brush almost 600 questions. (PS. I seemed to have done 60 questions at the time)

When he was 08, my God, it was so divine.

Winter vacation Time HDU actually has many times internal DIY competition (internal competition), but because of various evil reasons I also seem to be involved in a bit, in fact every time is the slaughter of it?

It was good to see the strength of the SHA cub during the period.

(3) Introductory article C

It was this competition that made me know about ACM.
And finally made me contact with ACM, feeling that time is good fast wow.
Early today came to the computer room, found the black Ya ya a piece of people-.-
Asked to know that it is to see the seat number ~ very magical and Vge,yayamao with the computer room ....

Before the game began to adapt to the system, found incredibly to use __int64 ... The usual foj are long long saying ... yx.

Overall the difficulty is good, is the scene of the atmosphere caused by their own more tense, a long time before the first problem, their own BS under.
The last question was done in Zoj, when the game AC was not thinking ...
A. The question of the majority
Given a set of numbers, the number of occurrences is the most, and if there are multiple answers, the output of the small
The data size is:
Number of elements <=100
elements in [-100,100]
This question was instantly killed by countless Daniel S.
Can be directly hash or violence statistics can also, data size too small pull
MS, which is the simplest question in this competition.
Slow to do is despised by-_-!!
B. Bracket expression
Say give a string, only ' (', ') '
If it had already been matched, it would have been output directly.
Otherwise output those that don't match well and match it well
))(())
Ans
)) ((//These do not match
(()) (())//output the matched string above

Simple Stack Application
How to tell if the exact match is not introduced here
Here's how to match the so-called "mismatched strings."
Take the example above.
This kind of string must be
A. Only ' ('
B. Only ') '
C. Divided into 2 parts, the previous part is ') ', followed by ' ('
Only if these 3 conditions are met, does not match
So it is very simple, simple statistics ') ' number, and then enter these ') ' before outputting the corresponding number of ' ('
Re-count ' (' The number, after outputting these, and then output the same number of ') '

C. Number of equations
Given a collection (up to a size of 5000), all the numbers are different, hoping to find a different three number a,b,c, satisfying a+b=c
and need to satisfy the logarithm of the condition
For Instance
3 1 2 5
Apparently 1+2=3,2+3=5,so ans is 2
Since the numbers are unique, I used a hash table to solve both:
Enumeration A, a, a constant time to query the existence of a+b, if present, is equal to one of a, if not, then can be counted as a
Time complexity is approximately o (n^2)

D. Number of Bits
Given a number (n<=10^1000), not greater than his own maximum of 1 m, and to M of the 2 binary bits and N if there are many m, then the output of small
First, we'll look at the small data
12->1100
So obviously 11 is the solution, because 11->1011
So what should we do about it?
Obviously, after converting the number to 2, start with the highest bit, find the first ' 1 ' (highest bit not counted), turn it into 0, why? Since this ensures that the number of changes after the change is less than the original number, and then the position behind the whole becomes 1
And got a solution m '
But, and compared to the original n
Why?
15->1111
According to the above rules, 1011 is obtained.
Obviously the answer should be 15, 4 ' 1 '
So a comparison can be

The most the most the most most (omit countless "most") nausea is not only the realization of high-precision, with the addition, seek mod, add, multiply ...
The knock is spitting blood ... With Java good like what problem, very embarrassing, this problem wasted a lot of time, leading to tragedy

E. Simple BFS
F. Not seen, is said to be simple but very disgusting simulation problem ... Fortunately not seen: (
G. Strange arrays
calculate the sum in [0..LCM (Asize,bsize)-1] and then calculate with the geometric series summation formula (the key of equal ratio is the i/bsize on the Power)
Pay attention to the use of the formula when seeking(A/b)%c= (A% (b*c))/bTo do sth.
H. Maximum tree height
This is the most failed place in the game, Zoj's game has been done, but also in the time of the game, and now incredibly silly.
Hey ~
Direct enumeration of points with a degree of 1 can
The last node number takes a min, and the depth takes Max to
(above this algorithm in some cases will tle ...) Continue to want ing ...)
The following is an algorithm for the WZC God Cow
Pick a spot, find the longest way out of it, and come back from the endpoint you found. Can prove that this is the right one. Embarrassed to die the problem,*&%&^%^& (Ignore 2^inf)

In general will be more than the previous scene to do a lot of good, at least not so nervous. Good formal game ~ also sent the topic book, Great, also saw WS ll ... The last 470 points awkward ending, also do not know is the first few, wait for the final result ~

Contact ACM FAST 1 Anniversary, think of what I did not, it is the school game made me contact with ACM, here thank you to help me at the beginning Daxia,vge,yayamao ... Thank you for asking me to answer the questions that seem silly and naïve now, thank you: a:-100<n<100 Hash count
B: Get a stack, after pairing end if the stack empty, output the original string, otherwise the contents of the output stack, if there is ' in the stack ') ', left to fill ' (', if the stack has ' (', right to fill ') '. Output.
C: Sort, enumerate c,a array header, b take array tail, two indents to find all a+b=c;
D; high-precision, turn into 2, from the high up to find the 2nd 1, if the 1 after the 0 output of the original number, otherwise this 1 into 0, the back of all into 1, in turn into 10 binary output.
E: Simple bfs+ simple DP ...
F: If you do not understand the topic suggested to find a snake game to play, write this question, you probably can develop a snake game yourself ...
G: not yet done ...
H: Take the origin to the BFS to find the deepest depth and the smallest number of nodes, take this node BFS out the correct answer

(4) Introductory article ding

Too much pain, idle nothing dry and sha cub in Hdu hung a game

HDU first "Old Rookie Cup" programming open, can be said to be my first question ...

Rookie grew up.--hdu first "Old Rookie Cup" programming open

This...... The first time the question is obviously more embarrassing, various forms such as data size does not conform to the data and other errors in the endless. Cause this game to make a lot of people depressed

(5) Introductory article E

FJNU School Race, the first live team match before the varsity team

-_-'s original purpose was just to get acquainted with the teaming pattern.
Here's a very simple way to talk about the game today.
Obviously today's shortcomings revealed undoubtedly, because at the beginning did not find the state of the team, resulting in the first 1 hours of a problem did not appear ....
I didn't get the first orange balloon until I 10:13:441y c.
Of course, this time a lot of teams beside me actually had 3 questions-_-yming ...
Whatever, but there's no pressure.-_-after all, is not for what, is to experience the atmosphere ~
G I introduced the formula, submitted 1Y to get the yellow balloon, there have been countless teams over the problem ....
A, wavelet and I discussed later, using O (n^4) algorithm 1Y, get the Pink Balloon:), in fact can completely O (n^3)
But then a team actually 4 questions-_-... It wasn't long before 5 questions ... Continue to yming.
ph Write B inexplicably wa several times.
The last very magical water over and got the blue balloon
12:47:05,f,nim+ begged sg,1y water over, got the first purple balloon in the audience
Finally admire the Xiaobo, debugging a few times after AC H, got someone else has been getting a long green balloon

Final 6, I 3,xiaobo 2,ph 1
The first time the team exposed the problem to be regarded as the experience-_-
At the same time ym a team, in the last 2 minutes water over F, directly to the summit
PS.FJNU volunteers were very enthusiastic-thank them:)

PS: Then teammate Xiaobo (ZWB), chijing (ph)

The first one has been successfully insured to the Chinese Academy of Sciences, the second head of the current seems Ali (I currently three do not?) ...... T_T)

(5) Getting Started

2 Sub-regional races

Another year of retirement, the past has consulted many of the problems of Daniel in this year after the regional game officially retired, sad ...


Departs October 29
Bought a group of snacks to take to the train, suddenly found that the train sleeper and yy in completely different, so small place I really do not know how I squeeze in, go to the time is also very hot, at night was also hot woke up several times, brought to the things almost no how to eat, dizzy a day. So after sleep, and then chat a few hours later to Wuchang , thanks to the big HH and Liu Yang SMS ~

October 31 Opening Ceremony
WHU volunteers really is mm minority, so now suddenly think of a volunteer male appeared in the opening ceremony, closing, the scene ... Why can a man be seen so many times by me-_-

OK, so the topic of warm-up is really old, obviously only a relatively simple question, as for the B is yy after several times wa,c is completely not to see the said (Hash no useful ~, seriously admire the small HH Brave through C)

November 1, the date of the good is indeed very brave.

The opening not long suddenly saw the pink balloon, so I immediately went to see C, but suddenly found that the description of the topic is more elegant, looked at a long time did not understand the meaning, and then teammates in I have not read the topic when the moment is over ... Then we went to see a relatively simple simulation and g, the simulation of the problem is very smooth 1Y, and G is due to the wrong view of the problem, led to a WA.
The following is B, because the teammate yy out of a fairly orz of the structure of the scheme, so with Tuopu finished 2Y (1th re is the details of the problem), the next is H,h I see is DP, but obviously I can not write out, so the Captain Yy after 2Y, at this time we ranked 10th ... I saw the hope of gold ... Found e still can be made, so began the cup, to the end is still not through E. Ended my year's ACM competition in a depressed

Ningbo and Wuhan 2 times the 2 silver, among them has the surprise also has the helpless. No matter what the result, this is a good exercise for my new person .... So the next goal is very clear, more coding ability, Learn something new. I am also very food, but if I do not do anything or only so, but I did the result although it may be I am still very food, but I will at least not regret bless2 a teammate, cooperation or very happy, remember the summer vacation more than 30 meal, ACM really fun.

Re. So the review went, first of all the arrears of the class completed.


Next year look forward to Aekdycoin performance ~

(5) Introductory article Geng

The 2 regional races in 2010 were briefly summed up as: Comrades still need to work hard ~

The first time in Harbin Copper is in line with the style of the cup, as for the second Hangzhou division is my lump of excrement bad a pot of good porridge (T_T)

So 09, 10 counted, I seem to go to 4 times Regional tournament +2 times it seems the result is 3:2:1, this ...

(6) Introductory article A-propyl-n-heptyl

First Contact Oi: passing Ninqing OJ, added an inner Mongolia mm asked 01 backpack implementation

First quiz: HDU first old rookie Cup

First Live race: Ningbo Division

First time Clustering: Ningbo

The first sign to arrive: your own (-_-)

First Disciple: NARUTOACM

。。。。

(7) About Acm_diy (Group No.: 48866438)

Acm_diy has now grown up to a nationally known deluge, with tens of thousands of chats. There are many epic stories and unusual quotations. At the same time, the group gathered to the national dozens of colleges and universities of the acmer, among them are similar to HHANGER,HL and other masters. This group has sprung up a variety of baidu,tencent male, I hope you have an interest in HR have been watching onlookers. This group of Acmer are strictly managed to ensure that the meat is delicious, non-toxic harmless, absolutely no added pigments and hormones!

"Turn" ACM summary _by Aekdycoin