登录
首页 » Visual C++ » liu

liu

于 2017-04-07 发布 文件大小:476KB
0 400
下载积分: 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 个回复

  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • jiaotong
    用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
    2013-03-23 13:06:49下载
    积分:1
  • Campus-navigation-problem
    校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。 要求: (1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 (4)修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)
    2011-08-12 10:34:14下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • BigNumeberOperator
    这是高精度大数运算的源码,对于大于64位的整形数字的四则运算,是万能的啊……(This is the code of big number s operator.)
    2011-08-09 15:25:09下载
    积分:1
  • xx
    说明:  数据结构实验报告链表的操作,包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)
    2009-11-25 08:36:26下载
    积分:1
  • B_Tree
    B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
    2020-10-18 18:17:26下载
    积分:1
  • Project_ShortestPath
    任务:实现Dijkstra算法 工程名:Project_ShortestPath 要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
    2013-08-21 16:40:41下载
    积分:1
  • jose
    约瑟夫环(约瑟夫问题)是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1,最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
    2015-01-09 17:28:41下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载