【C语言刷题】第十二天：加量加餐继续，代码题训练，融会贯通IO模式

#define  _CRT_SECURE_NO_WARNINGS  1

#include <stdio.h>
int main()
{
	int arr[101] = { 0 };
	int n = 0;
	scanf("%d", &n);
	int i = 0;
	for (i = 0; i < n; i++)
	{
		int m = 0;
		scanf("%d", &m);
		arr[m]++;
	}
	int x = 0;
	scanf("%d", &x);
	printf("%d", arr[x]);
	return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

#include <stdio.h>
int main()
{
	//难点：要让转义字符不是转义字符
	printf("printf(\"Hello world!\\n\");\n");
	printf("cout << \"Hello world!\" << endl;");

	return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

#include <stdio.h>
int is_prime(int n)
{
	int i = 0;
	for (i = 2; i < n; i++)
	{
		if (n % i == 0)
			return 0;
	}
	return 1;
}
int main()
{
	int count = 0;
	int i = 0;
	for (i = 100; i <= 999; i++)
	{
		//判断i是否为质数
		if (is_prime(i))
		{
			count++;
		}
	}
	printf("%d\n", count);
	return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

//方法1
#include<stdio.h>
int main()
{
	int n = 0;
	int arr[100];
	scanf("%d", &n);
	int i = 0;
	for (i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
	}
	//排序
	for (i = 0; i < n - 1; i++)
	{
		int j = 0;
		for (j = 0; j < n - 1 - i; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}
	}
	//去重-比较n-1对
	int j = 0;
	for(j = 0;j < n-1;j++)
	{
		//把i+1后边的元素往前移动
		if (arr[i] == arr[i + 1])
		{
			int k = 0;
			for (k = i; k < n - 1; k++)
			{
				arr[k] = arr[k + 1];
			}
			n--;
			i--;
		}
	}
	//打印
	for (i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
		return 0;
	}

//方法2：
#include<stdio.h>
int main()
{
	int n = 0;
	int arr[1001] = { 0 };
	scanf("%d", &n);
	int i = 0;
	int m = 0;
	for (i = 0; i < n; i++)
	{
		scanf("%d", &m);
		arr[m] = m;
	}
	for (i = 0; i < 1001; i++)
	{
		if (arr[i] != 0)
			printf("%d ", arr[i]);
	}
	return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

#include <stdio.h>
#include <stdlib.h>
struct Node
{
	int data;
	struct Node* next;
};
int main()
{
	int n = 0;
	struct Node* list = NULL;
	struct Node* tail = NULL;
	//输入结点
	int i = 0;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		int data = 0;
		scanf("%d", &data);
		struct Node* n = (struct Node*)malloc(sizeof(struct Node));
		n->data = data;
		n->next = NULL;
		if (list == NULL)
		{
			list = n;
			tail = list;
		}
		else
		{
			tail->next = n;
			tail = tail->next;
		}
	}
	//删除结点
	int del = 0;
	scanf("%d", &del);
	struct Node* cur = list;
	struct Node* prev = NULL;
	while (cur)
	{
		//找到了
		if (cur->data == del)
		{
			struct Node* pd = cur;
			//如果删除的是第一个结点
			if (cur == list)
			{
				list = list->next;
				cur = list;
			}
			else
			{
				//删除的不是第一个结点
				prev->next = cur->next;
				cur = prev->next;
			}
			n--;
			free(pd);
		}
		else//找不到
		{
			prev = cur;
			cur = cur->next;
		}
	}
	cur = list;
	printf("%d\n", n);
	while (cur)
	{
		printf("%d ", cur->data);
		cur = cur->next;
	}
	//释放空间
	cur = list;
	while (cur)
	{
		del = cur;
		cur = cur->next;
		free(del);
	}
	return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

#include <iostream>
using namespace std;

class TDate
{
private:
    int Month;
    int Day;
    int Year;

public:
    // 带有默认形参值的构造函数
    TDate(int year = 0, int month = 0, int day = 0) : Year(year), Month(month), Day(day) {}

    // 输出日期函数，按“日/月/年”格式输出
    void showDate()
    {
        cout << Day << "/" << Month << "/" << Year << endl;
    }

    // 设置日期函数，从键盘输入年、月、日
    void setDate()
    {
        cin >> Year >> Month >> Day;
    }
};

int main()
{
    TDate date;
    date.setDate();
    date.showDate();
    return 0;
}

#define  _CRT_SECURE_NO_WARNINGS  1

#include <stdio.h>

// 定义日期结构体
typedef struct 
{
    int Year;
    int Month;
    int Day;
} TDate;

// 初始化日期（模拟构造函数）
void initDate(TDate* date, int year, int month, int day) 
{
    date->Year = year;
    date->Month = month;
    date->Day = day;
}

// 输出日期，按“日/月/年”格式
void showDate(TDate* date) 
{
    printf("%d/%d/%d\n", date->Day, date->Month, date->Year);
}

// 设置日期，从键盘输入年、月、日
void setDate(TDate* date) 
{
    scanf("%d %d %d", &date->Year, &date->Month, &date->Day);
}

int main() 
{
    TDate date;
    // 初始化日期（使用默认值 0,0,0）
    initDate(&date, 0, 0, 0);
    setDate(&date);
    showDate(&date);
    return 0;
}