Website: /JudgeOnline/
You can register an account, which will keep the correct code you submit every time. There are many questions above, with a wide range and various difficulties. Of course, there are also some judges from other universities, such as Shanghai Jiaotong University.
2.ACM/ICPC (ACM acm international collegiate programming contest) was the first successful competition. And, of course, the National College Programming Competition. Every year, some websites and organizations also hold programming competitions. For example, the Baidu Star Programming Contest held by Baidu in recent years is also very influential. The first example of a given example question is a detailed introduction to ACM. The sample question is the initial question of a program competition in our school, which is relatively simple. (In addition, the ACM program contest can also be programmed in C++, and both undergraduates and graduate students can participate. )
3. Some simple ACM sample questions (because it is an international competition, ACM questions are all E, and the following part is translated)
H-acm rule
describe
ACM/ICPC (ACM International Collegiate Programming Contest) is an annual competition organized by ACM (American Computer Association Computing Machinery Association), which started at 1976. It is the most influential event in the global college students' computer programming ability competition, and is recognized as the largest and highest-standard college students' programming competition in the world. It is a broad stage for contestants to show their computer talents, a direct reflection of the achievements of computer education in famous universities, and the best opportunity for information enterprises to talk with the world's top computer talents. ACM/ICPC obtained the qualification to participate in the World Finals through group selection. In 2006, 2362 teams from11universities in more than 25 regions around the world participated in the 26th ACM/ICPC competition. In March 2002, about 60 teams and more than 200 players from all over the world participated in the final in Hawaii.
In the ACM/ICPC competition, the automatic question judging system is used, which not only lightens the burden of the ACM/ICPC competition organizers, but also makes the competition more fair and just. Because in the competition, the competition members can see their own rankings, which makes the competition more transparent.
The ranking of ACM/ICPC competition is as follows:
1: The team with the most problems ranks first.
2. If the number of teams solving problems is the same, the team with the least total time ranks first.
Note: During the competition, the time of each test question will start from the competition until the answer of the test question is judged to be correct. During this period, every wrong operation will be fined for 20 minutes, and the correct questions will not be counted. Then the time spent solving all problems and the punishment time add up to: the total time spent by the team.
Now, you need to write a program to rank teams (assuming no more than 200 teams).
invest
Multi-line test data, each line contains the game information of each team.
The format of each team's competition information is as follows:
The string n m represents the team name, the number of problem-solving times and the total time spent (where: the team name is a string with a length of no more than 30, the number of problem-solving times is an integer between 1… 10, and the range of punishment time is no more than the range of int).
When you enter end, it means that the input is over.
output
Output the game information of each team according to the ranking.
Each competition team occupies one line.
The format of each line is:
The string n m represents the total time taken to solve the team name problem.
Sample input
amstl 3 65
Danonio 2 50
Lutdan 3 60
end
Sample output
Lutdan 3 60
amstl 3 65
Danonio 2 50
I think I need a boathouse.
describe
Fred is considering buying a piece of land in Louisiana to build a house recently. In the process of investigating the land, Fred found that the land in Louisiana will be reduced by 50 square miles every year due to the erosion of the Mississippi River. Fred intends to spend the rest of his life there, so he doesn't want his house to be eroded by the river in his lifetime. Now he needs to know whether he will be eroded by the river.
After doing more investigation, Fred learned that the land here was eroded into a semicircle along the river bank. This semicircle with (0,0) as the center is divided into two parts by the X axis, with the river below the X axis and the river bank above. At the beginning of the first year, the semicircle is 0, indicating that the river bank has not been eroded. (The semicircle is shown in the figure below)
invest
The positive integer n in the first row indicates how many sets of data need to be calculated. In the following n rows, each row contains two real numbers X and Y, which indicate the position of the house that Fred considered in the coordinate system with (0,0) as the origin. Y is a nonnegative number in miles.
output
Calculate in which year Fred's houses in X and Y will be eroded by the river. Corresponding to the input data, output your calculation results in the following form: "Property n: This property will begin to erode in Z year", where n is the nth group of data, and z is the number of years that you calculated to begin to erode. Finally, output a sentence "Output is over." Indicates the end of calculation.
Sample input
2
1.0 1.0
25.0 0.0
Sample output
Property 1: The property will begin to erode in 1 year.
Property 2: The property will begin to erode in the 20th year.
End of output.
suggestion
The location of the house will not be exactly on the semicircle boundary, whether indoors or outdoors.
The calculated output of the program you submitted will be judged automatically by the system. Your results should fully meet the output requirements, including letter case, punctuation and spaces. Statements including the last line should also match exactly.
All the data given are in miles.
F-N！ Calculation of
describe
n！ = N×(N- 1)×(N-2)×(N-3)×N ....
invest
Enter a positive integer m in the first line, indicating how many n's are to be calculated!
The next line starts with m positive integers (1 ≤ N ≤ 1 1, m ≤ 9).
output
Output the factorial results of these m positive integers, one per line.
Sample input
three
1
2
five
Sample output
1
2
120
I- vertical histogram
describe
Write a program to read four lines of uppercase (i.e. all uppercase letters) text input (each line does not exceed 72 characters) from the input file, and print a vertical histogram showing the number of times each letter (but excluding spaces, numbers or punctuation) appears in all uppercase input. Set the output in strict accordance with the format shown.
invest
* Line 1 .. 4: Four lines of uppercase text, with no more than 72 characters per line.
output
* Line 1 ..: lines with asterisks and spaces, followed by a line of capital letters separated by spaces. Don't print unnecessary blanks at the end of any line. Do not print any leading blank lines.
Sample input
The quick brown fox jumped over the lazy dog.
This is a test of your.
Histogram program.
Hello!
Sample output
*
*
* *
* * * *
* * * *
* * * * * *
* * * * * * * * * *
* * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * *
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
J- white won? Or does the black one win?
describe
Cinderalla has been addicted to playing gobang recently. But when playing with other friends, she always loses, so she wants to use the computer to help her judge which side won the game. For the sake of simplicity, let's remove some rules first. We think that as long as there are five connected pieces on one side of the board, which side will win is certain. Your task is to write a program to judge which side wins the game we give.
invest
There is only one set of input data. The first row has two positive integers m, n(5 ≤ m, n ≤ 10), which respectively represent the number of rows and columns of the chessboard. The following 2*n+ 1 line is a description of the chessboard, which consists of "+","-"and "|", where "*"
output
There is only one set of output data. If white wins, export white to win! If black wins, export black to win!
Sample input
5 10
+-+-+-+-+-+-+-+-+-+-+
| |*| | | | | | | | |
+-+-+-+-+-+-+-+-+-+-+
| | |*|#| | | | | | |
+-+-+-+-+-+-+-+-+-+-+
| | |#|*|#|#| | | | |
+-+-+-+-+-+-+-+-+-+-+
| | | | |*|#| | | | |
+-+-+-+-+-+-+-+-+-+-+
| | | | | |*| | | | |
+-+-+-+-+-+-+-+-+-+-+
Sample output
White won!
suggestion
One side of a given chess game must win.