搜索资源列表
zoj_1004_Anagrams_by_Stack.rar
- zoj 1004 的题目，这是一个经典的水壶倒水问题，题目中没有要求最少的次数倒满水，所以还可以不用bfs，本题用了bfs,zoj 1004 topics, this is a classic problem of water pouring money down the drain, the title does not require a minimum number of filling water, so it can be bfs, the title used bfs
mimo_waterfilling
- 注水算法是OFDM中子载波及信道分配中最核心的算法，很多改进算法都是基于此-Water pouring
a
- Problem A: Pouring Water-I guess that everybody can play this game: There are two buckets(水桶). Bucket 1 has the capacity X and bucket 2 has Y liters(升). Then you are asked to measure Z liters of water in one of the two buckets, using the three operat
Cwatterrl
- 经典的倒水问题输入：２个水桶的容积积（x，y）输出：量出z升水的最少次数 -Classic pouring problem Input: two buckets of volume plot (x, y) output: Expenditure and z liters of water for at least the number of
water
- 程序设计经典题目“倒水”源码加超详细讲解-Program design classic title "pouring" source code plus ultra detailed explanation
ML-detctior-a-water-pouring
- ML detector water pouring technique used in lte
Waterfilling
- 代码汇总了几种不同的MIMO系统中注水算法，适合初学者学习仿真-“Water_Pouring” for water-pouring algorithm