A selection of initial training topics of ACM in Qingdao Polytechnic

Training objectives: To have the initial coding ability, master the most basic ACM types and input and output, the development of ACM early thinking mode, to lay the foundation for later learning;

Topic Type: Topic selection in the title, I try to choose some types of topics of the public, do not involve esoteric algorithms, but to examine certain thinking ability of the problem;

The difficulty of the topic: I do my best to ensure that the early learners have the ability to complete or simple reference parsing can be completed.

Because of the time, I can not guarantee that all the questions are done again, some problems may and the description has a certain discrepancy. Also, these problems can only make a preliminary understanding of the format of the topic, for later learning to lay a foundation, and even you have not really started the ACM study Road:

Note: The default HDU refers to hang electric OJ; CF refers to Codeforces;

Simple warm up: (Hang electricity 11 pages of the problem in addition to individual problems, can do;

HDU 2000:http://acm.hdu.edu.cn/showproblem.php?pid=2000

HDU 2002:http://acm.hdu.edu.cn/showproblem.php?pid=2002

HDU 2004 (recommended with switch and if else two methods): http://acm.hdu.edu.cn/showproblem.php?pid=2004

HDU 2010:http://acm.hdu.edu.cn/showproblem.php?pid=2010

HDU 2013:http://acm.hdu.edu.cn/showproblem.php?pid=2013

hdu2024 (This topic can deepen the recognition of identifiers naming rules): http://acm.hdu.edu.cn/showproblem.php?pid=2024

hdu2030 (originally did not want to out this problem, but can understand the character of Chinese characters, seconds a off): http://acm.hdu.edu.cn/showproblem.php?pid=2030

hdu2031 (Transformation of the system): http://acm.hdu.edu.cn/showproblem.php?pid=2031

hdu2032 (Yang Hui's triangle): http://acm.hdu.edu.cn/showproblem.php?pid=2032

hdu2034:http://acm.hdu.edu.cn/showproblem.php?pid=2034

hdu2035 (modulo): http://acm.hdu.edu.cn/showproblem.php?pid=2035

hdu2041:http://acm.hdu.edu.cn/showproblem.php?pid=2041

Codeforces on some of the questions: I personally advocate Codeforces:

CF 579A (a simple thinking question): Http://codeforces.com/problemset/problem/579/A

CF 581A (large water problem, active mood): Http://codeforces.com/problemset/problem/581/A

CF 584A (slightly some pits, but not difficult): Http://codeforces.com/problemset/problem/584/A

Here I give the CF 584A: Click on the Open link

HDU 2019 (Recommended Practice for insertion Sort after completing this question): http://acm.hdu.edu.cn/showproblem.php?pid=2019

Learning tasks: Learn to select sort, insert sort, bubble sort;

hdu2020 (Sort Foundation title, suggested selection, insert sort, bubble sort, select sort of sort finish): http://acm.hdu.edu.cn/showproblem.php?pid=2020

The difficulty rises some:

HDU 2097:http://acm.hdu.edu.cn/showproblem.php?pid=2097 Topic Analysis: This problem method has many kinds; simple hints (10 decimal digits and: while (n) {sum+= n%10; n/=10;}

HDU 2098:http://acm.hdu.edu.cn/showproblem.php?pid=2098 Topic Resolution: Enumerate all the numbers that can be split, if two are prime, then ans++, and finally enter ans;