本题要求编写一个解密英文藏头诗的程序。建议使用动态内存分配方法处理字符串的输入。
输入格式:
输入为一首英文藏头诗,每句一行,小于20行,每行不超过80个字符,以#作为藏头诗的输入结束标志。
输出格式:
取出每句的第一个字符,连接在一起形成一个字符串并输出。
输入样例:
I come into a dream
Leaves fall down but spring
over a lake birds flying
village have its nice morning
everywhere can feel happiness
Years have never been
owners don't need anything
until the sun bring another wind
#
输出样例:
ILoveYou
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int n=0,i;
char* poem[20],str[80],mean[20];
gets(str);
while(str[0]!='#')
{
poem[n]=(char*)malloc(sizeof(char)*(strlen(str)+1));
strcpy(poem[n],str);
n++;
gets(str);
}
for(i=0;i<n;i++)
{
mean[i]=*poem[i];
free(poem[i]);
}
mean[i]='\0';
puts(mean);
return 0;
}