Search - PI - CodeBus

Search - PI - List

[Data structs] 计算圆周率 DL : 0: 计算圆周率 Pi (π)值, 精确到小数点后 10000 位只需要 30 多句代码！-Pi calculated pi () values, accurate to 10,000 decimal places only need more than 30 sentence code!
Date : 2026-01-02 Size : 5kb User : 幸
[Data structs] Pile DL : 0: 用JAVA 写的数据结构 PILE 的算法,这种算法是法国大学老师算PILE 的一种方法.-using Java to write the data structure of the stiffness This algorithm is counting France braced University teachers a way.
Date : 2026-01-02 Size : 6kb User : li
[Data structs] 语法分析之左递归实验 DL : 0: 此为编译原理实验报告学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用内含设计算法目的源码等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行（2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则；消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的产生规则。-to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols starting from the beginning will never be able to reach the end of the webs
Date : 2026-01-02 Size : 43kb User : 何浩
[Data structs] PI的编程 DL : 0: 求pi的程序，包括实验报告，误差分析，收敛性分析-for pi procedures, including experimental report, error analysis, convergence analysis, and so on
Date : 2026-01-02 Size : 255kb User : 林林
[Data structs] task_compositor DL : 0: 带有期限的作业排序问题：假定只能在一台机器上处理n个作业，每个作业均可在单位时间内完成；又假定每个作业i都有一个截止期限di>0(它是整数)，当且仅当作业i在它的期限截止以前被完成时，则获得pi>0的效益。求具有最大效益值的可行解。文件中包含详细的源代码和注释，以实现这个经典的问题。-period with the operations scheduling problem : the assumption that only a machine n handling operations, each of the operating units can be completed within time; Also assume that each job i have a deadline di
Date : 2026-01-02 Size : 1kb User : agang
[Data structs] Carlo1 DL : 0: 蒙特卡洛算法实现的检验pi的值和求二重积分的高级算法，值得下载-Monte Carlo algorithm realize the value of pi test and high-level algorithm for double integral, it is worth downloading
Date : 2026-01-02 Size : 58kb User : 毕比
[Data structs] pi DL : 0: 一个求pi的源程序，可以精确到几十位外加一个自己编写的记事本程序 pi.c-A source for pi can be accurate to plus a dozen have written the Notepad program pi.c
Date : 2026-01-02 Size : 249kb User : 阳丰俊
[Data structs] 1108 DL : 0: 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即n ?i=1pi xi 取得最大值。约束条件为n ?i =1wi xi≤c 和xi?[ 0 , 1 ] [ 1≤i≤n]。-At 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from a backpack loaded, select the items, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight of the backpack should not exceed capacity, the best means by loading articles into the highest value, that is, n? I = 1pi xi to obtain the maximum value. Constraint condition for n? I = 1wi xi ≤ c and xi? [0, 1] [1 ≤ i ≤ n].
Date : 2026-01-02 Size : 1kb User : samuel
[Data structs] d DL : 0: 1． 0-1背包问题在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高 -1. 0-1 knapsack problem at 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from a backpack loaded, select the items, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight of the backpack should not exceed capacity, the best load is the value of items packed by the highest
Date : 2026-01-02 Size : 141kb User : 松柏长青
[Data structs] 0-1 DL : 0: 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-At 0/1 knapsack problem, there is a need for a capacity of c to load the backpack. N items from a selected items into the backpack, each item i the weight wi, the value of pi. Feasible for loading backpack, backpack in the total weight of items should not exceed the capacity of backpack, the best means by loading items into the highest value.
Date : 2026-01-02 Size : 168kb User : 松柏长青
[Data structs] small DL : 0: 计算PI的值有各种各样，看看这个算法是不是很简洁呢-Calculated PI values are varied, to see if this algorithm is not very simple and does
Date : 2026-01-02 Size : 3kb User : weihao
[Data structs] KnapsackProblem DL : 0: 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些物品重量的和大于M，要求所有选中要装入背包的物品总重量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
Date : 2026-01-02 Size : 1kb User : lily
[Data structs] pi_1 DL : 0: 一个求pi的很巧妙的经典算法我对对其中的想法深感震惊所以拿来给朋友们分享-Pi seeking a classical algorithm very clever of them I am deeply shocked by the idea of it were given to friends to share
Date : 2026-01-02 Size : 5kb User : xiang
[Data structs] algorithmCollection DL : 0: 经典算法合集基于C语言写成,非常经典的算法包括数论,排列组合,矩阵运算超大整数运算求高精度pi值等多个算法.-Collection based on classic algorithms written in C language,including number theory, permutations and combinations, large integer arithmetic ,matrix operations and high precision value of pi and other algorithms.
Date : 2026-01-02 Size : 431kb User : 当当
[Data structs] circumference DL : 0: 用c语言求圆周率的问题，精确到小数点后2000位-Using c language question seeking pi, accurate to the decimal 2000
Date : 2026-01-02 Size : 156kb User : zhangxin
[Data structs] Calculate-Pi DL : 0: 高效的数值算法，使用普通精度计算圆周率。不需要高精度的支持-Efficient numerical algorithm, calculation of pi using ordinary precision. Does not require the support of high-precision
Date : 2026-01-02 Size : 45kb User : BlueStar
[Data structs] mente-clo DL : 0: 蒙特卡洛算法求pi，蒙特拉罗是计算机技术发展以来比较被重视的算法，在各个方面都被广泛应用-Mente clo
Date : 2026-01-02 Size : 8kb User : sam
[Data structs] 1 DL : 0: 利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of Pi, assuming M, Wi, Pi are integers. Given method of loading the design process, so that the total value of goods into the bag maximum.
Date : 2026-01-02 Size : 1kb User : 00
[Data structs] pi.tar DL : 0: 一个好的算法，用于演示，如何获得PI值，可以精确到小数点后上千位。-A good example to show how to produce the value of PI
Date : 2026-01-02 Size : 226kb User : Huangq
[Data structs] calculate--PI DL : 0: 计算PI后面的很多位的C程序，可以直接运行，代码精简快速-calculate Pi rapidly and accuratly
Date : 2026-01-02 Size : 1kb User : 冯俊羲

« 12 »