登录
首页 » Visual C++ » liu

liu

于 2017-04-07 发布 文件大小:476KB
0 425
下载积分: 1 下载次数: 6

代码说明:

  一.问题描述 对2006年度全国80多个城市的每天空气质量状况进行查询、排序等操作。 空气质量状况对象包括城市代码、城市名称、首要污染物、污染指数、污染物级别、空气状况、年、月、日 二、实验要求 1. 普通查询:输入城市名称和城市代码,分别查询该城市每天、每周、每月、每季度和全年的空气质量状况 例子:查询太原市2006年第8周的空气质量状况 2.统计查询: (1)输入城市名称和城市代码,分别查询该城市每周、每月、每季度和全年的空气质量为优、良、轻微污染、轻度污染、重污染的天数 例子:查询石家庄市2006年第2季度空气质量为轻微污染的总天数 (2)根据时间查询空气质量状况:输入周编号、月编号、季度编号或年编号,以及空气质量为优、良、轻微污染、轻度污染、重污染的天数,查找相应的城市名称 例子:查询2006年5月,空气被轻度污染3天以上的城市有哪些? 3.排序查询 (1)输入周编号、月编号、季度编号或年编号,查询城市空气质量的排行榜 例子:查询2006年第6周,全国空气平均质量最好的前20个城市为哪些? 三、数据文件 Data.txt(one. Problem Description of the air quality day in 2006 more than 80 cities nationwide query, sorting and other operations. Air Quality objects include city code, city name, the primary pollutant, pollution index, contaminant level, air condition, year, month, day two, experimental requirements 1. General Queries: Enter a city name and city codes, each query in the city daily, weekly, monthly, quarterly example air quality and full year: Queries air quality in Taiyuan first eight weeks of 2006 2. Statistical inquiry: (1) enter a city name and city codes, each query in the city weekly, monthly, quarterly and annual air quality as excellent, good, slight pollution, light pollution, heavy pollution days example: inquiry Shijiazhuang City in 2006 second quarter, the air quality is the total number of days a slight pollution (2) according to time of the query air quality conditions: enter the week number, month number, quarter number or in number, and the air quality is excellent, good, sli)

文件列表:

第六次上机作业(孔令芝201511210132)
...................................\data.txt,1198526,2007-12-29
...................................\hashMap.h,2570,2016-12-25
...................................\main.cpp,8970,2016-12-25
...................................\main.exe,1889408,2016-12-25
...................................\SeqList.h,1044,2016-12-25

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • KMP---MFC
    数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
    2020-07-04 08:40:01下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • expression
    利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
    2011-10-30 14:14:01下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • main
    求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
    2016-03-29 19:29:19下载
    积分:1
  • 1_1
    最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
    2009-09-13 22:45:01下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • FIFO-c
    说明:  操作系统先来先服务调度算法模拟(C描述)(Operating a first-come first-served scheduling simulation (C description))
    2010-04-13 00:02:35下载
    积分:1
  • B_Tree
    B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
    2020-10-18 18:17:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载