Can anyone give me a title for this year s NOIP Divisional League? 15

1. Read 2 positive integers within 100 from the keyboard, multiply and output vertically.

For example, enter: 89 13

Output Format: Again: Input: 16 8

Output format: 2. Solve the number puzzle: a b c a b a

d d d d d d

3. Enter a high-precision positive integer n on the keyboard, and the remaining numbers will form a new positive integer in the original left and right order after removing any s digits. For a given n and s, the program finds a scheme such that the remaining numbers are composed of the smallest new numbers.

4. Enter a string with a length of no more than 40 from the keyboard, and delete, insert or replace it as required.

For example: 'This is a book.''Now the string is carried out, and the functions are:

d: Delete a character, and the command is as follows:

d a where a is the character that has been removed.

For example, d s means that the deleted character is 's', and if there are multiple 's's' in the string, the first occurrence is deleted. As in the example above, the deleted result is: 'thi is a book.'’

i: Insert a character, and the command format is:

i a1 a2 where a1 is inserted in front of the specified character and a2 is the character to be inserted.

For example, i s d means inserting the character 'd' before the specified character 's', and if there are multiple 's's in the original string), it is inserted before the last character, as in the example above

Original string: 'This is a book.'’

After inserting: 'This ids a book.'’

r: Replace a character, and the command format is:

r a1 a2 where a1 is the character to be replaced, a2 is the replaced character, if there are multiple a1s in the original string, all should be replaced. For example:

Original string: 'This is a book.'’

Enter the command: r o e

The replaced string is: 'This is a beek.'’

In the process, if the changed character does not exist, a prompt message will be given: there is no character in the string

#include ""

int n=1,k,n;

int f(int t) * is used to find the last k bit of n to the t power * }if(flag)printf("-1");

system("pause");

return 0;}

1. The sort you use is bubbling sorting, which is the slowest. At least sort by choice?! Examine the efficiency of the various sorting algorithms.

2. Change while(i<=j) to i3, array a is too big, 30001 is enough, right? Save time allocating administrative memory. (If you want to be faster, turn int a into unsigned char a).

In the end, the program is right, it just doesn't strive for excellence.

PS: The score is O, it's too stingy, right?!

Question 3 Use the Pythagorean theorem to calculate the square of the distance between each bomb and the two systems, find the closer system, and refresh its radius square (if the new radius square is larger than the old one); Note that this question does not need to be squared, because after the square is squared, it is equal to doing nothing;

The fourth question is actually a must-win, and the answer is the largest of the second largest tacit value in each row of the array;

I'm a C++ learner, so I'll just talk about the idea here:

This problem is very simple, it is simply to find the greatest common divisor of n numbers (where n numbers are the number of people in n schools).

A simple analysis can lead to this conclusion.

That's a big time frame? So small a space? Right?

Find the greatest common divisor directly, don't open the function or array, just record the previous one, and find the greatest common divisor in a loop, o(nm=5000000).

Anyway, you should have made a mistake...

2005 National Informatics Division League Simulation Competition.

Number Name Time Limit Memory Limit Proposition Test data.

1 cat cat small fish 1 second 16mb chineselyl 10 sets.

2 Creative Fish Eating Method 1 second 32MB ljch 10 sets.

3 Love Snail 2 seconds 64MB ljch 10 sets.

4 128MB ljch 10 sets.

Question 1: Cats and cats.

Submit File:Input File:

Output: Cat Cat is an angel in the hearts of many animals in the jungle, and she is very proud of it. The cat loves to eat fish the most, and she has to go to the pond every day to fish and eat. Cats often eat fish brains and are particularly strong in mathematics, however, the little girl's personality determines her playfulness.

One day, the cat caught a lot of fish. She didn't want to eat the poor fish right away, but tortured enough before eating it (there is a saying that the most poisonous thing is the cat's heart).

The cat sorts the many, many (too many to count) fish to be beautiful, and each fish is numbered ......n, the ith fish is 3 (i-1).

The cat wants to put the fish in a bucket. She can take as many fish as she wants at a time. The "total aesthetic degree" of the fish with high midstream is the sum of the aesthetic degrees of each fish. For example, if the cat takes the first fish and the third fish this time, then the aesthetic degree is 1+9=10.

The cat wants to know what the k-th largest "total beauty" she can get.

Read k from the file, and output the k-largest "total beauty" that the cat can obtain.

Input grinding into the data:

The data contains n+1 rows, and the first row reads n(n 100). The following n lines contain a k per line.

Output data: The output of Lu Ji contains n rows, and each line outputs a corresponding result.