- 博客(12)
- 资源 (10)
- 问答 (1)
- 收藏
- 关注
原创 hihocoder 1453 Rikka with Tree (简单DP)
描述 众所周知,萌萌哒六花不擅长数学,所以勇太给了她一些数学问题做练习,其中有一道是这样的: 勇太有一棵 n 个节点的以1为根的有根树。现在他可以对这棵树进行若干次操作,每一次操作可以选择树上的一个点然后删掉这个点和它的儿子之间的所有边。 现在勇太想要知道对于每一个 k ∈ [1, n],最少需要多少次操作才能让图中恰好存在 k 个联通块。 当然,这个问题对于萌萌哒
2016-12-25 21:13:52 530
原创 Python3 + django 支持 MySQL
最近要做一个数据库的课程设计,嗯,没记错的话是三周的时间(17,18,19)下周还有一个很重要的考试,所以一定要赶快完成。
2016-12-22 12:12:20 2263 1
原创 HDU 3394 Railway (点双联通分量+桥)
Problem Description There are some locations in a park, and some of them are connected by roads. The park manger needs to build some railways along the roads, and he would like to arrange tourist rou
2016-12-11 21:35:21 530
原创 POJ 1459 Power Network (最大流)
Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce a
2016-12-11 10:45:39 693 1
原创 POJ 1273:Drainage Ditches (最大流)
Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to reg
2016-12-11 09:38:27 530
原创 POJ 3469:Dual Core CPU (最大流)
Description As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. The rou
2016-12-10 20:33:59 744
原创 计算机组成原理 - 实验报告
第一次实验 手动实验环境 十六位机运算器实验 第二次实验 通用寄存器实验 准双向I/O口实验 地址总线组成实验 第三次实验 十六位数据总线实验 存储器读写实验 指令总线运用实验 第四次实验 微控制器实验
2016-12-10 10:58:14 16112
原创 HDU 3549 Flow Problem (最大流)
Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input The first line of inpu
2016-12-04 18:56:23 522
原创 HDU 3376 Matrix Again (最小费用最大流)
Problem Description Starvae very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. Every time starvae should to do is that choose a detour w
2016-12-04 14:04:28 853
原创 POJ 2135 Farm Tour (最小费用流)
Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of whi
2016-12-01 20:44:33 826
原创 HDU 1269:迷宫城堡 (Tarjan强连通分量)
Problem Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在
2016-12-01 09:49:24 557
Spig 网站浮动小人 (javascript)
2018-06-17
OICQ 聊天室(Java 课程设计)
2018-06-17
Little Giant (C++ 课程设计)
2018-06-17
Flow blog(数据库课程设计)
2018-06-17
Codeforces Edu Hacking
2018-06-17
HDU 自动 AC 机(Python)
2018-06-17
黑白棋 (Reversi)
2016-10-30
黑客帝国C语言
2016-01-07
VC绘图库Easyx
2016-01-05
C语言一个小小的问题,望解答
2016-01-08
TA创建的收藏夹 TA关注的收藏夹
TA关注的人