二分法习题HDU2199
摘要:
AC代码:#include#includeusing namespace std;double y;double f(double n){ return 8*pow(n,4)+7*pow(n,3)+2*pow(n,2)+3*n+6;}double find(){ double mid; ... 阅读全文
posted @ 2014-07-17 15:56 tianxia2s 阅读(218) 评论(0) 推荐(0) 编辑