4.10练练手

/*#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)

struct Student
{
	long num;
	float score;
	struct Student *next;
};
int n;

struct Student *creat()							//建立链表函数
{
	struct Student *head;
	struct Student *p1,*p2;
	n = 0;
	p1 = p2 = (struct Student *) malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	head = NULL;
	while((p1->num) != 0)
	{
		n = n+1;
		if(n == 1)
			head = p1;
		else
			p2->next = p1;
		p2 = p1;
		p1 = (struct Student *) malloc(LEN);
		scanf("%ld,%f",&p1->num,&p1->score);
	}
	p2->next = NULL;
	return head;
}
void print(struct Student *head)						//输出链表的函数
{
	struct Student *p;
	printf("\nNow,These %d records are:\n",n);
	p = head;
	if(head != NULL)
		while(p != NULL)
		{
			printf("%ld %5.1f\n",p->num,p->score);
			p = p->next;
		}
}
void main()
{
	struct Student *head;							
	head = creat();								//调用creat函数，返回第一个结点的起始地址
	print(head);								//调用print函数
}*/

/*有若干个人员的数据，其中有学生和教师。学生的数据中包括：姓名，号码，性别，职业，班级。教师的数据包括：
姓名，号码，性别，职业，业务。要求用同一个表格来处理。*/
/*#include <stdio.h>
struct											//声明无名结构体类型
{
	int num;
	char name[10];
	char sex;
	char job;
	union										//声明无名共用体类型
	{
		int clas;
		char position[10];
	}category;									//种类
}person[2];

int main()
{
	int i;
	for(i = 0; i < 2; i++)
	{
		printf("please enter the data of person:\n");
		scanf("%d %s %c %c",&person[i].num,&person[i].name,			//标记
			&person[i].sex,&person[i].job);
		if(person[i].job == 's')
			scanf("%d",&person[i].category.clas);
		else if(person[i].job == 't')
			scanf("%s",person[i].category.position);
		else
			printf("Input error!");
	}
	printf("\n");
	for(i = 0; i < 2; i++)
	{
		if(person[i].job == 's')
			printf("%-6d%-10s%-4c%-4c%-10d\n",person[i].num,person[i].name,
					person[i].sex,person[i].job,person[i].category.clas);
		else
			printf("%-6d%-10s%-4c%-4c%-10s\n",person[i].num,person[i].name,
					person[i].sex,person[i].job,person[i].category.position);

	}
	return 0;
}*/
#include <stdio.h>
int main()
{
	char name[10];
	scanf("%s",&name); //也可以没有&，意义不一样，但结果一样
	printf("%s",name);
	return 0;
}