【小学】招生——统计适龄儿童数据

最新推荐文章于 2024-05-30 20:15:33 发布

枢衡KraHsu

最新推荐文章于 2024-05-30 20:15:33 发布

阅读量448

点赞数 2

分类专栏：学习笔记-乐学文章标签：算法数据结构 c++

本文链接：https://blog.csdn.net/CharlesHsuu/article/details/128240714

版权

学习笔记-乐学专栏收录该内容

53 篇文章 147 订阅

订阅专栏

【小学】招生——统计适龄儿童数据

在这里插入图片描述

C代码

#include <stdio.h>
struct stu{
	int bir[3];
	char sex,name[9];
}children[185];
int OK(int y,int m,int d){
	if(y != 2013) return y < 2013;
	if(m != 9) return m < 9;
	return d == 1;
}
int main(){
	int list[180] = {0},num;
	for(int i = 0;i < 180;i++){
		scanf("%d,",&num);
		scanf("%d-%d-%d,%c,%s",&children[num].bir[0],&children[num].bir[1],&children[num].bir[2],&children[num].sex,children[num].name);
		if(OK(children[num].bir[0],children[num].bir[1],children[num].bir[2])) list[num] = 1;
	}
	printf(" BH   BirthDay  Name  Sex\n-------------------------\n");
	for(int i = 1;i <= 180;i ++) 
		if(list[i]) printf("%04d %d-%02d-%02d %-6s %c\n",i,children[i].bir[0],children[i].bir[1],children[i].bir[2],children[i].name,children[i].sex);
}

c++代码

#include <bits/stdc++.h>
using namespace std;
struct stu{
	int bir[3];
	char sex,name[9];
}children[185];
int OK(int &y,int &m,int &d)
{
	if(y != 2013) return y < 2013;
	if(m != 9) return m < 9;
	return d == 1;
}
int main()
{
	int flag = 0,list[180] = {0},num;
	for(int i = 0;i < 180;i++)
	{
		scanf("%d,",&num);
		scanf("%d-%d-%d,%c,%s",&children[num].bir[0],&children[num].bir[1],&children[num].bir[2],&children[num].sex,children[num].name);
		if(flag || OK(children[num].bir[0],children[num].bir[1],children[num].bir[2])) flag = list[num] = 1;
	}
	printf(" BH   BirthDay  Name  Sex\n-------------------------\n");
	for(int i = 1;i <= 180;i ++) 
		if(list[i])
			printf("%04d %d-%02d-%02d %-6s %c\n",i,children[i].bir[0],children[i].bir[1],children[i].bir[2],children[i].name,children[i].sex);
}