自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

小坏蛋_千千

I was caught in a heavy rain!

  • 博客(741)
  • 资源 (10)
  • 问答 (1)
  • 收藏
  • 关注

原创 HZAU 1209 Deadline (技巧)

Description There are N bugs to be repaired and some engineers whose abilities are roughly equal. And an engineer can repair a bug per day. Each bug has a deadline A[i]. Question: How many engin

2017-04-23 18:21:18 766

原创 HZAU 1199 Little Red Riding Hood (dp)

Description Once upon a time, there was a little girl. Her name was Little Red Riding Hood. One day, her grandma was ill. Little Red Riding Hood went to visit her. On the way, she met a big wolf. “Th

2017-04-23 18:02:15 731 2

原创 POJ 1947 Rebuilding Roads (树形dp)

Description The cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn’t have time to rebuild any extra roads,

2017-04-23 09:14:43 525

原创 POJ 2486 Apple Tree (树形 dp)

Description Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip a

2017-04-22 11:30:07 575

原创 POJ 1925 Spiderman (DP)

Description Dr. Octopus kidnapped Spiderman’s girlfriend M.J. and kept her in the West Tower. Now the hero, Spiderman, has to reach the tower as soon as he can to rescue her, using his own weapon, th

2017-04-21 09:32:02 506

原创 POJ 3071 Football (概率dp)

Description Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order

2017-04-20 20:58:43 504

原创 POJ 3101 Astronomy (数学)

Description There are n planets in the planetary system of star X. They orbit star X in circular orbits located in the same plane. Their tangent velocities are constant. Directions of orbiting of all

2017-04-20 20:40:23 931

原创 C++ 虚继承派生类构造函数的写法

昨天做题时候发现的问题普通的继承中,我们可以在当前类(C)构造函数的初始化表中指明如何去构造直接父类(B),然后在该父类(B)构造函数的初始化表中指明如何构造祖先类(A)。

2017-04-18 13:57:53 1515 1

原创 POJ 2891 Strange Way to Express Integers (扩展欧几里得)

Description Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following: Choose k different positive integers

2017-04-18 11:20:54 587

原创 HDU 1520 Anniversary party (树型dp)

Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the superviso

2017-04-16 18:58:08 602

原创 POJ 1026 Cipher (置换群)

Description Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret

2017-04-13 15:10:36 498

原创 POJ 3270 Cow Sorting (置换群)

Description Farmer John’s N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique “grumpiness” level in the range 1…100,000. Since grumpy cows are more likely to damag

2017-04-12 21:46:58 567

原创 POJ 1286 Necklace of Beads (Polya)

Description Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). If the repetitions that are produced by rotation around the center of the circula

2017-04-12 12:51:44 564

原创 POJ 2411 Mondriaan's Dream (状压dp)

给出一个 n*m 的方格,问用 1*2 的小方格来填充总共有多少种方法。

2017-04-11 12:38:15 477

原创 ZOJ 3870 Team Formation (二进制)

Description For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his university. Edward knows the skill level of each st

2017-04-05 21:01:48 669

原创 ZOJ 3872 Beauty of Array (技巧)

Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the beauty of all contiguous s

2017-04-05 20:15:11 527

原创 POJ 2409 Let it Bead (Polya)

Description “Let it Bead” company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that customer

2017-04-05 13:14:54 593

原创 CCCC L3-013. 非常弹的球 (高中物理)

刚上高一的森森为了学好物理,买了一个“非常弹”的球。虽然说是非常弹的球,其实也就是一般的弹力球而已。森森玩了一会儿弹力球后突然想到,假如他在地上用力弹球,球最远能弹到多远去呢?他不太会,你能帮他解决吗?当然为了刚学习物理的森森,我们对环境做一些简化: 假设森森是一个质点,以森森为原点设立坐标轴,则森森位于(0, 0)点。 小球质量为w/100 千克(kg),重力加速度为9.8米/

2017-03-29 19:01:47 807

原创 POJ 1185 炮兵阵地 (状压DP)

Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P”表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中

2017-03-28 21:01:49 538

原创 HDU 4886 TIANKENG’s restaurant(Ⅱ) (哈希)

Problem Description After improving the marketing strategy, TIANKENG has made a fortune and he is going to step into the status of TuHao. Nevertheless, TIANKENG wants his restaurant to go internation

2017-03-19 11:13:33 555

原创 POJ 2029 Get Many Persimmon Trees (枚举)

Description Seiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to reward him for his meritorious career in educati

2017-03-17 20:04:09 482

原创 POJ 3280 Cheapest Palindrome (区间DP)

Description Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the

2017-03-17 17:50:59 546

原创 POJ 1054 The Troublesome Frog (枚举+优化)

Description In Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump through your rice paddy at night, flattening rice pl

2017-03-16 17:41:31 567

原创 POJ 1191 棋盘分割 (记忆化搜索)

Description 将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行) 原棋盘上每一格有一个分值,一块矩形棋盘的总分为其所含各格分值之和。现在需要把棋盘按上述规则分割成n块矩形棋盘,并使各矩形棋盘总分的均方差最小

2017-03-14 16:20:42 491

原创 POJ 3422 Kaka's Matrix Travels (最小费用流)

Description On an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bot

2017-03-14 11:16:11 452

原创 POJ 2195 Going Home (最小费用最大流)

Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little ma

2017-03-13 19:21:38 466

原创 HDU 4908 BestCoder Sequence (哈希)

Problem Description Mr Potato is a coder. Mr Potato is the BestCoder. One night, an amazing sequence appeared in his dream. Length of this sequence is odd, the median number is M, and he na

2017-03-12 21:21:38 539

原创 HDU 4907 Task schedule (技巧)

Problem Description 有一台机器,并且给你这台机器的工作表,工作表上有n个任务,机器在ti时间执行第i个任务,1秒即可完成1个任务。 有m个询问,每个询问有一个数字q,表示如果在q时间有一个工作表之外的任务请求,请计算何时这个任务才能被执行。 机器总是按照工作表执行,当机器空闲时立即执行工作表之外的任务请求。Input 输入的第一行包含一个整数T, 表

2017-03-12 21:07:08 509

原创 HDU 4884 TIANKENG’s rice shop (模拟)

Problem Description TIANKENG managers a pan fried rice shop. There are n kinds of fried rice numbered 1-n. TIANKENG will spend t time for once frying. Because the pan is so small, TIANKENG can fry k

2017-03-12 20:44:09 982

原创 HDU 4883 TIANKENG’s restaurant (最大覆盖数)

Problem Description TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its delicious dishes. Today n groups of customers come to

2017-03-12 19:52:45 423

原创 HDU 4858 项目管理 (简单图+暴力)

Problem Description 我们建造了一个大项目!这个项目有n个节点,用很多边连接起来,并且这个项目是连通的! 两个节点间可能有多条边,不过一条边的两端必然是不同的节点。 每个节点都有一个能量值。 现在我们要编写一个项目管理软件,这个软件呢有两个操作: 1.给某个项目的能量值加上一个特定值。 2.询问跟一个项目相邻的项目的能量值之和。

2017-03-12 19:35:31 453

原创 HDU 4857 逃生 (拓扑排序)

Problem Description 糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道很窄,大家只能排成一行。 现在有n个人,从1标号到n。同时有一些奇怪的约束条件,每个都形如:a必须在b之前。 同时,社会是不平等的,这些人有的穷有的富。1号最富,2号第二富,以此类推。有钱人就贿赂负责人,所以他们有一些好处。 负责人现在可以安排大家排队的顺序,由于收了好处,所

2017-03-12 19:23:11 1254

原创 POJ 2516 Minimum Cost (最小费用最大流)

Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M sup

2017-03-11 20:19:09 379

原创 论中英文写作思维与算法的关系

图论真是一个好东西,现实中很多事物都可以用它来描述,我们的思维也一样,平平常常的事情中也会有着很深的算法。

2017-03-10 18:07:27 540

原创 POJ 1364 King (差分约束)

Description Once, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ”If my child was a son and if only he was a sound king.” After nine months her child was bor

2017-03-09 21:10:29 644

原创 POJ 3159 Candies (差分约束)

Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute

2017-03-09 18:25:24 439

原创 POJ 3096 Surprising Strings (枚举)

Description The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising i

2017-03-08 12:52:43 620

原创 蓝桥杯 垒骰子 (DP+矩阵快速幂)

赌圣atm晚年迷恋上了垒骰子,就是把骰子一个垒在另一个上边,不能歪歪扭扭,要垒成方柱体。 经过长期观察,atm 发现了稳定骰子的奥秘:有些数字的面贴着会互相排斥! 我们先来规范一下骰子:1 的对面是 4,2 的对面是 5,3 的对面是 6。 假设有 m 组互斥现象,每组中的那两个数字的面紧贴在一起,骰子就不能稳定的垒起来。 atm想计算一下有多少种不同的可能

2017-03-07 21:05:41 1325

原创 POJ 2151 Check the difficulty of problems (概率DP)

Description Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:

2017-03-03 15:12:54 347

原创 POJ 2632 Crashing Robots (模拟)

Description In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, a

2017-03-02 17:57:46 438

Spig 网站浮动小人 (javascript)

采用 Javascript 开发的网站前端浮动小人,具体效果可以见:https://www.dreamwings.cn 小人支持右键秘密链接,支持自动根据时间问候(早上好、中午好之类),支持自动间隔一段时间展示 hihokito 精美句子。

2018-06-17

OICQ 聊天室(Java 课程设计)

大二第一学期的 Java 课程设计,支持用户注册,单人聊天,多人聊天,支持好友列表,支持个人信息修改,数据库使用 mysql,采用 Java 开发。

2018-06-17

Little Giant (C++ 课程设计)

一款使用 cocos-2dx 开发的 io 类休闲游戏,仿“弓箭手大作战”,C++ 课程设计。(可在 win10 应用商店下载开玩) ---------------------------------------------------- 游戏名称: 进击的小巨人 游戏类型: 休闲类 3D 游戏 运行环境: Windows 7及以上、Linux、Android 4.0及以上、IOS、Windows 10 mobile 游戏引擎: Cocos2d-x 3.10

2018-06-17

Flow blog(数据库课程设计)

一款使用 Python django 开发的简易 CMS 内容管理系统 标记:大二 - 数据库课程设计 --- 这是一款简约、高效的博客系统,你可以利用它发表自己的文章,每一篇文章都必须要有一个分类,这是你应该创建的,不过文章的标签属性可以有多个。同时,游客可以对公开的文章进行评论,当然,你也可以回复他。 你可以创建自己的页面,这会在首页显示,不过遗憾的是,当页面太多的时候首页看起来会很奇怪,不过关于这一点我们会在以后修复它。 博客支持多用户同时注册并管理,不过新建用户的时候需要管理员的授权,管理员可以授予用户相应的管理权限,而用户则可以在满足权限的情况下把它授予给其他人。为了管理方便,我们引入了组的概念,对组进行授权相当于我们对组内的所有用户进行授权。

2018-06-17

Codeforces Edu Hacking

使用 C# + WPF 开发 --- 还在发愁打了那么多场比赛都没有进入首页么? 还在为了前 5 的 hacker 名额阅读千份代码么? 是的,你没有看错! 这是一个 Edu & Div.3 轮 Open hacking 错误代码自动查找器! 你只需要提前构造好某些题的叉点数据,填入它,OK!一切就是这么的方便! 注:仅适用于 Edu 以及 Div.3 轮比赛赛后 hack,不支持 Div.1/2 赛时 hack。 适用人群:想进入首页 Hack 榜的选手

2018-06-17

HDU 自动 AC 机(Python)

一款 HDU OJ 的自动刷题工具,搜索来源可选用 百度搜索 / 必应搜索,支持并行以及串行查找,祝早日刷上航电首页哦~ 使用 Python 编写,执行之前你需要在同目录下创建文件 aclog.txt ,然后粘贴进你目前已经 AC 的题目,然后在代码执行过程中便不会去再查找这些题了。

2018-06-17

黑白棋 (Reversi)

大一的课程设计,写的是一个黑白棋,也就是这个,支持单人模式,双人模式,联机对战,电脑演示等功能,也是千千做的最好的一个啦!easyx图形界面,目前仅是单线程运行。

2016-10-30

一个人的时光

一个人的时光,终究只是一个人,这是一个用GBK语言编写的脚本小游戏,欢迎大家来下载哦!

2016-02-04

黑客帝国C语言

动态效果,黑客帝国 #include <windows.h> #define ID_TIMER 1 #define STRMAXLEN 25 //一个显示列的最大长度 #define STRMINLEN 8 //一个显示列的最小长度 LRESULT CALLBACK WndProc (HWND, UINT, WPARAM, LPARAM) ; typedef struct tagCharChain //整个当作屏幕的一个显示列,这是个双向列表 { struct tagCharChain *prev; //链表的前个元素 TCHAR ch; //一个显示列中的一个字符 struct tagCharChain *next; //链表的后个元素 } CharChain, *pCharChain; typedef struct tagCharColumn { CharChain *head, *current, *point; int x, y, iStrLen; //显示列的开始显示的x,y坐标,iStrLen是这个列的长度 int iStopTimes, iMustStopTimes; //已经停滞的次数和必须停滞的次数,必须停滞的次数是随机的 } CharColumn, *pCharColumn; /***********************/ ..................... ...................

2016-01-07

VC绘图库Easyx

EasyX 是 Visual C++ 平台的绘图库(静态 LIB),用以在 Visual C++ 中模拟 Turbo C 的绘图库头文件 ,并实现对 32 位和 64 位 Windows 的支持,解决了Turbo C 由于使用 16 位的 BGI 绘图库不支持 Windows 的问题。同时,EasyX 针对 Windows 的特点,在色彩范围、分辨率、鼠标、批量绘图等方面做了相应的函数扩展。

2016-01-05

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除