 Jumping the Queue

Problem Description
The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own.Input
There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups.
Finally, a list of commands follows. There are three different kinds of commands:● ENQUEUE X  Mr. or Ms. X goes into the queue
● DEQUEUE  the first person gets the ticket and leave the queue
● STOP  end of test caseThe input will be terminated by a value of 0 for n.
Output
For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output.Sample Input
2
3 Ann Bob Joe
3 Zoe Jim Fat
ENQUEUE Ann
ENQUEUE Zoe
ENQUEUE Bob
ENQUEUE Jim
ENQUEUE Joe
ENQUEUE Fat
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
5 Anny Jack Jean Bill Jane
6 Eva Mike Ron Sony Geo Zoro
ENQUEUE Anny
ENQUEUE Eva
ENQUEUE Jack
ENQUEUE Jean
ENQUEUE Bill
ENQUEUE Jane
DEQUEUE
DEQUEUE
ENQUEUE Mike
ENQUEUE Ron
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0Sample Output
Scenario #1
Ann
Bob
Joe
Zoe
Jim
FatScenario #2
Anny
Jack
Jean
Bill
Jane
Eva
Jumping the Queue _course
20171103Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue用DP怎么实现？_course
20181029Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue 跳出队列问题_course
20200310Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue 队列解决的办法_course
20200112Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue 是怎么写的呢_course
20191231Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue 怎么弄呢_course
20191228Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
Jumping the Queue 队列的问题如何实现的_course
20200622Problem Description The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own. Input There will contain one or more test cases. Each test case begins with the number of groups n (1<= n <=1000). Then n group descriptions follow, each one consisting of the number of friends belonging to the group and those people's distinct names. A group is a friend group. People in one group are friend with each other. A name is a string of up to 4 characters chosen from {A, B, ..., Z, a, b, ..., z}. A group may consist of up to 1000 friends. You may assume that there is no one belong to two different groups. Finally, a list of commands follows. There are three different kinds of commands: ● ENQUEUE X  Mr. or Ms. X goes into the queue ● DEQUEUE  the first person gets the ticket and leave the queue ● STOP  end of test case The input will be terminated by a value of 0 for n. Output For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the person who just gets a ticket on a single line. Print a blank line between two test cases, but no extra line at the end of output. Sample Input 2 3 Ann Bob Joe 3 Zoe Jim Fat ENQUEUE Ann ENQUEUE Zoe ENQUEUE Bob ENQUEUE Jim ENQUEUE Joe ENQUEUE Fat DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 2 5 Anny Jack Jean Bill Jane 6 Eva Mike Ron Sony Geo Zoro ENQUEUE Anny ENQUEUE Eva ENQUEUE Jack ENQUEUE Jean ENQUEUE Bill ENQUEUE Jane DEQUEUE DEQUEUE ENQUEUE Mike ENQUEUE Ron DEQUEUE DEQUEUE DEQUEUE DEQUEUE STOP 0 Sample Output Scenario #1 Ann Bob Joe Zoe Jim Fat Scenario #2 Anny Jack Jean Bill Jane Eva
 5.30MB
滴滴萌猫跳一跳辅助(安卓))
20201020按提示开无障碍服务，给悬浮窗权限，然后打开跳一跳游戏，打开软件，切回游戏画面，拖动顶部栏往下让软件的半透明区域把猫覆盖完，可以点击右上角数字修改为1.6。使用方法:从猫的位置按住往第二个方块上滑动，松
软件测试2小时入门
20181010本课程内容系统、全面、简洁、通俗易懂，通过2个多小时的介绍，让大家对软件测试有个系统的理解和认识，具备基本的软件测试理论基础。 主要内容分为5个部分： 1 软件测试概述，了解测试是什么、测试的对象、原则、流程、方法、模型； 2.常用的黑盒测试用例设计方法及示例演示； 3 常用白盒测试用例设计方法及示例演示； 4.自动化测试优缺点、使用范围及示例‘； 5.测试经验谈。
C语言及程序设计初步
20150105课程针对没有任何程序设计基础的初学者，全面介绍C语言及利用C语言进行程序设计的方法。课程注重知识的传授，更关注学习者能够通过实践的方式，真正学会利用C语言解决问题，奠定程序设计的基础。为此，专门设计了实践方案，指导学习者在听讲的同时，有效完成实践。讲课中还适时穿插进行学习指导，帮助初学者尽快掌握程序设计的学习方法。
 9.61MB
UniBeast 7.1.zip
20190809用于制作mac os Sierra 10.12 启动u盘，在普通电脑上安装。
 2KB
中信银行计算机类笔试
20120412中信银行计算机类笔试题75道单项选择题，需要的同学何以参考一下，希望能帮到你
 42KB
81个Python爬虫源代码
2018121381个Python爬虫源代码，内容包含新闻、视频、中介、招聘、图片资源等网站的爬虫资源
 5.37MB
满足三角不等式的TSP问题的近似算法
20180715完美版满足三角不等式的TSP问题的近似算法，内部含有课程设计报告和源程序，适合大学数据与算法分析课程学习。 满足三角不等式的TSP问题的近似算法： (1)描述及输入原始数据模块 (2)求解最小生成树模
 3.32MB
ab153xut apk 洛达1562a蓝牙检测工具 真ut版
20200930洛达官网 ab153xut 安卓检测软件 1562a正品检测工具 真ut版 csdn之前的那个是Repair版 无法检测 顺便建议下载ios蓝牙工具配合使用 准确鉴别1562a
人脸识别项目实战特训营
20200706人脸识别的技术及业务已经广泛应用于各行各业，如住宅安全管理、电子身份证护照、公安、司法和刑侦、自助服务、信息安全等。本训练营连续4天的时间，通过Opencv来采集需要识别的人脸数据库，并建立相关的ID信息标签，利用开源数据集，通过MTCNN模型、FaceNet模型的学习，编写人脸识别程序，并实现整个项目。
 3.8MB
JS 函数式编程指南 epub
20180322这本书的主题是函数范式（functional paradigm），我们将使用 JavaScript 这个世界上最流行的函数式编程语言来讲述这一主题。有人可能会觉得选择 JavaScript 并不明智，
微信公众平台开发入门
20150106本套课程的设计完全是为初学者量身打造，课程内容由浅入深，课程讲解通俗易懂，代码实现简洁清晰。通过本课程的学习，学员能够入门微信公众平台开发，能够胜任企业级的订阅号、服务号、企业号的应用开发工作。 通过本课程的学习，学员能够对微信公众平台有一个清晰的、系统性的认识。例如，公众号是什么，它有什么特点，它能做什么，怎么开发公众号。 其次，通过本课程的学习，学员能够掌握微信公众平台开发的方法、技术和应用实现。例如，开发者文档怎么看，开发环境怎么搭建，基本的消息交互如何实现，常用的方法技巧有哪些，真实应用怎么开发。
MySQL数据库从入门到实战课
20191231限时福利1：购课进答疑群专享柳峰（刘运强）老师答疑服务。 为什么说每一个程序员都应该学习MySQL？ 根据《20192020年中国开发者调查报告》显示，超83%的开发者都在使用MySQL数据库。 使用量大同时，掌握MySQL早已是运维、DBA的必备技能，甚至部分IT开发岗位也要求对数据库使用和原理有深入的了解和掌握。 学习编程，你可能会犹豫选择 C++ 还是 Java；入门数据科学，你可能会纠结于选择 Python 还是 R；但无论如何， MySQL 都是 IT 从业人员不可或缺的技能！ 【课程设计】 在本课程中，刘运强老师会结合自己十多年来对MySQL的心得体会，通过课程给你分享一条高效的MySQL入门捷径，让学员少走弯路，彻底搞懂MySQL。 本课程包含3大模块： 一、基础篇： 主要以最新的MySQL8.0安装为例帮助学员解决安装与配置MySQL的问题，并对MySQL8.0的新特性做一定介绍，为后续的课程展开做好环境部署。 二、SQL语言篇： 本篇主要讲解SQL语言的四大部分数据查询语言DQL，数据操纵语言DML，数据定义语言DDL，数据控制语言DCL，学会熟练对库表进行增删改查等必备技能。 三、MySQL进阶篇： 本篇可以帮助学员更加高效的管理线上的MySQL数据库；具备MySQL的日常运维能力，语句调优、备份恢复等思路。
 35.81MB
navicat简体中文版 绿色版 （64位）
20160923解压后安装navicat，打开navicat执行PatchNavicat即破解成功。可以正常使用啦。
 12.36MB
匠心精作C++从0到1入门编程学习编程课程资料（黑马程序员）
20190507该文档资料是黑马程序员官网C/C++的视频课程配套的文档资料，内部包含《第1阶段C++ 匠心之作 从0到1入门学编程》、《第2阶段实战通讯录管理系统 》、《第3阶段C++核心编程 》、《第4阶段实
Java进阶高手课Java基础编程提升
20200427课程聚焦Java基础编程提升的核心知识点，以真实场景项目实战为导向，循序渐进，深入浅出的了解Java基础编程，讲解Java这门使用广泛的编程语言，助你能够游刃有余地游走在这些技术之中。
 博客 面向对象的设计原则
 下载 PHP使用GIFEncoder类处理gif图片实例
 博客 2020ICPC·小米 网络选拔赛第一场
 博客 docker笔记（一）
 博客 laravel文章增删改查
 下载 取光效率降热阻功率型LED封装技术
 博客 AcWing 393 雇佣收银员
 下载 CCFCSP认证前两题答案（初始2018）.rar
 博客 Java面试题（一）
 博客 优化sql查询速度
 博客 JavaWeb——从零开始构建一个客户管理系统（一）
 下载 基于减法聚类改进的模糊c均值算法的模糊聚类研究
 学院 Axure 9.0 因缺思厅案例教程
 博客 对LinkedList的理解
 学院 Vue.js 2.0之全家桶系列视频课程
 学院 项目管理工具箱
 下载 2个比较经典的PHP加密解密函数分享
 博客 [python网络编程]文件上传
 博客 oracle基本操作
 学院 Windows脚本bat文件批处理基础教程
 下载 原生JS绑定滑轮滚动事件兼容常见浏览器
 下载 PHP网页游戏学习之Xnova(ogame)源码解读（十五）
 学院 全新Vue3.0全家桶 零基础入门到项目实战
 学院 Java微信小程序鲜花礼品购物商城 大学生毕业设计教学视频
 下载 ZigBee无线传感器网络在远程环境监测中的应用设计
 博客 推荐系统task3
 博客 没有上司的舞会
 博客 浏览器回流和重绘
 下载 ThinkPHP模板IF标签用法详解
 博客 Manifesto of Software Craftsmanship