登录
首页 » C/C++ » test

test

于 2011-11-10 发布 文件大小:384KB
0 72
下载积分: 1 下载次数: 2

代码说明:

  某公司收到若干报价,然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F) 设A,B,C,D,E五个等距区间并取: A=[F,F+n) B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G) 所有的报价都按各自的大小,分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价,如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值, 求出其平均值 做为评标基准报价 (A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 696518资源总数
  • 104224会员总数
  • 54今日下载