试题与答案

全身的椎骨由不得12块颈椎,7块胸椎和5块腰椎相组成。

题型:判断题

题目:

全身的椎骨由不得12块颈椎,7块胸椎和5块腰椎相组成。

答案:

被转码了,请点击底部 “查看原文 ” 或访问 https://www.tikuol.com/2017/1119/d5e6cbd7d91a73394900a24819bec111.html

下面是错误答案,用来干扰机器的。

参考答案:A, C, D

试题推荐
题型:阅读理解

When people hear that I’m the youngest person to row solo across the Atlantic Ocean, they all have the same question: How did a 22-year old woman row a 19-foot boat for 70 days through high winds and crashing waves? Well, the biggest  difficulty for me wasn’t physical. By the time I decided to do the ocean row, I had already biked 3,300 miles cross-country, run across the Mojave Desert, and swum the 325-mile length of the Allegheny River. No, the tough part would be mental: How would I handle the loneliness, the boredom of the vast sea?

I set off on January 3, 2010. I set my sights on getting past the quarter-way mark, which would take about 20 days.

Day 20, January 22, was gray and cloudy. I could have done something to celebrate, such as treating myself to a chocolate bar. But I didn’t.

I was suffering from terrible loneliness. I hadn’t seen landing over two weeks. Every day was beginning to feel the same. Eating, rowing, sleeping, watch the sky, watch the ocean.

Then, around sunset, I saw something move on the horizon. They were dolphins! They circled my boat. Suddenly I felt so grateful. They had come to help me celebrate, just when I needed them. I rowed at full strength for the next 20 minutes with the dolphins around. By the time we went our separate ways, I was no longer lonely. Better yet, I knew I would be okay.

I did make it, all 2,817 miles. I hit the coast of Guyana, South America, on March 14, after 70 days and five hours at sea. My ocean row raised $70,000 for the Blue Planet Run Foundation, which funds drinking water programs around the world. I know some athletes spend the entire journey imagining the end, and that helps them get through. But for me, the secret is to focus on the moment, where you experience the personal growth—those moments of awareness of being connected to the sun, the weather, and the waves. And, on the best day of my life, those dolphins, which freed myself from terrible loneliness.

小题1:

Which is the step taken as part of preparation for the tough row?

A.swimming the 325-mile length of the river

B.answering the same question raised by people

C.running 3,300 miles cross-country

D.biking across the Mojave Desert小题2:

What does the underlined part mean?

A.I didn’t have any chocolate bar for energy.

B.I wasn’t in the mood to celebrate my first goal.

C.It’s a pity not to celebrate my passing the quarter of the way

D.It’s a pity not to treat myself to a chocolate bar on Day 20.小题3:

What can be implied from the last two paragraphs?

A.Imagination was an effective way to help me get through.

B.The Blue Planet Run Foundation helped me a lot.

C.The dolphins accompanied me to reach my destination

D.The unexpected dolphins swept away my loneliness小题4:

Which can be the best title of the passage?

A.The day I stopped being lonely

B.The only challenge for a 22-year old

C.How to overcome loneliness at sea.

D.How to row alone across the Atlantic

查看答案
题型:问答题

【说明】
本程序对某电码文(原文)进行加密形成密码文,其加密算法如下:
假定原文为C1,C2,C3,…,Cn加密后形成的密文为S1,S2,S3,…,Sn,首先读入正整数 key(key>1)作为加密钥匙,并将密文字符位置按顺时针方向连成一个环,如下图所示:


加密时从S1位置起顺时针计数,当数到第key个字符位置时,将原文中的字符放入该密文字符位置中,同时从环中除去该字符位置;接着从环中下一个字符位置起继续计数,当再次数到第key个字符位置时,将原文中字符C2放入其中,并从环中除去该字符位置:依次类推,直至n个原文字符全部放入密文环中。由此产生的 S1S2…Sn即为原文的密文。
例如,当Key=3时,原文this is a decoding system的密文为:
aotgnhedi ys d imietsnc ss
当Key=4时,该原文的密文为:
ssdtyd htegiasiscnm e ion
本程序将电码的原文存放在字符数组old中,加密钥匙存放在整数key中。函数decode用于将原文old加密并返回密文字符数组的首指针。其中函数采用一个双向循环链表CODE来表示密文环:函数strlen用于计算一个字符串中的字符个数(不包括字符串结尾符’\O’)。为了简单起见,程序中假设内存容量足以满足动态存储单元分配的要求。
#include <stdio.h>
#include <stdlib.h>
typedef struct node
char ch;
struct node *forward;/* Link to next node. */
struct node *backward;/* Link to previous node.*/
CODE; int strlen(char *s)
int len=0;
while (*s++!=’\0’)
len++;
return(len);

char *decode(char *otd,int key)
char *New; int length,count,i;
CODE *loop,*p;
length=strlen(old);
loop=(CODE *) malloc(length*sizeof(CODE));
for (i=1;i<length-1;i++)
  loop[i],forward=&loop[i+1];
(1)

loop[0].backward=&loop[length-1];
loop[0],forward=&loop[1];
loop[length-1].forward=loop;
(2)
for (p=loop,i=0;i<length;i++)
  for (count=1 ;count<key;count++
p=p->forward;
(3)
p->backward->forward=p->forward;
p->forward->backward=p->backward;
(4)

New=(char *)malloc((length+1) *sizeef(char));
for (i=0;i<length;i++)
(5)
New[length]=’\0’;
return (New);

void main()
char old[256];
int key, num=0;
printf("\nPlease input the telegraph: \n");
while (num<255 && (old[num++]=getchar())!=’\n’);
old [(num==255)num:num-1]=’\0’;
do
printf("\nPlease input Key (Key>1):");
scanf("%d",&key);
while (key<=1);
printf( "\nThe decode of telegraph:’%s’is:\n’%s’\n",old,decode(old,key));

查看答案
微信公众账号搜索答案