资源列表
QQ任意聊
- 任意QQ聊天.
chaohundunfenchak
- 超混沌系统的分岔图求解，内容详细易懂，可读性好-Hyperchaotic system to solve the bifurcation diagram, detailed easy to understand and readable
spreader
- 扩频通信中用伪随机码对信息数据进行扩频，实现频谱扩展！-Spread spectrum communication using pseudo-random code spreading of information data to realize the expansion of the spectrum!
space_coding_SC
- Space coding with selective combining.
dd
- 给定含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数。多重集S中重数最大的元素称为众数。 例如，S={1，2，2，2，3，5}。 多重集S的众数是2，其重数为3。 -Given n elements containing multiple sets S, each element appears in S as the number of multiplicity of the elements. Multi-set S of elements in the mul
Tag
- WPF tag云,实现类似flash的效果-WPF tag cloud
zijihewenti
- 子集和问题的一种做法，适合算法课提交的小程序，VC++编译通过的-A subset of the practice and issues for submission algorithm applet class, VC++ compiler through the
needelman-wunch
- needelman-wunch in c-needelman-wunch in c++
simulation
- this code is for simulation solution
find-the-posotion-of-elements
- 随机产生100个3位数以内的数，存放在一组数组中，并查找最大元素和最小元素的位置。-100 three-digit randomly generated number within, stored in a set of array and find the maximum and minimum elements of the position of elements.
2
- 1、编写函数，实现顺序栈的各种基本操作（可从上一实验中直接获取）； 2、编写函数，实现运算符的优先级处理； 3、编写函数，实现算术表达式的计算。 -1, write a function, the stack order to achieve a variety of basic operations (directly obtained from previous experiments) 2, write a function to achieve priority pro
Hometask
- Codeforces Round 131 DIV.2-B Hometask-You are given a set of digits, your task is to find the maximum integer that you can make these digits. The made number must be divisible by 2, 3, 5 without a residue. It is permitted to use not all digits the