短文改错。Two friend met a bear when they we_爱下问搜题

搜题请搜索小程序“爱下问搜题”

问题改错题

短文改错。

Two friend met a bear when they
went through a forest by foot.
One of them ran to nearest tree
and climbed up very quick. He forgot his
friend. He thought only of herself. His friend
knew bears didn't eat dead men.
And he didn't move when the bear came to him.
Then the bear go away. The man in the tree smiled
and said, "What did the bear say to you?"
His friend answered, "He said I needed an new friend."

1_____________
2_____________
3_____________
4_____________
5_____________
6_____________
7_____________
8_____________
9_____________
10____________

答案

1. friend→friends 2. by→on 3. nearest→the nearest 4. quick→quickly 5. herself→himself

6. √ 7. And→So 8. go→went 9. said→asked 10. an→a

单项选择题 B1型题

含苯环的氨基酸是（）

A.组氨酸

B.酪氨酸

C.谷氨酸

D.蛋氨酸

E.丝氨酸

问答题

阅读以下说明和C函数，将应填入__（n）__处的字句写在答题纸的对应栏内。

【说明1】函数Counter（intn，intw［］）的功能是计算整数n的二进制表示形式中1的个数，同时用数组w记录该二进制数中1所在位置的权。例如，十进制数22的二进制表示为10110。对于该二进制数，1的个数为3，在w［0］中存入2（即2¹）、w［1］中存入4（即2²）、w［2］中存入16（即2⁴）。【C函数1】

【说明2】函数Smove（intA［］，intn）的功能是将数组中所有的奇数都放到所有偶数之前。其过程为：设置数组元素下标索引i（初值为0）和j（初值为n-1），从数组的两端开始检查元素的奇偶性。若A［i］、A［j］都是奇数，则从前往后找出一个偶数，再与A［j］进行交换；若A［i］、A［j］都是偶数，则从后往前找出一个奇数，再与A［i］进行交换；若A［i］是偶数而A［j］是奇数，则交换两者，直到将所有的奇数都排在所有偶数之前为止。【C函数2】