zoukankan      html  css  js  c++  java
  • POJ 1064 Cable master

    ……
    精度各种锅
    转了int再判终于对了
    还有cin cout 被卡
    伤心

    #include <cstdio>
    
    using namespace std;
    
    const int MAXN=10011;
    
    double input;
    int N, K;
    int Num[MAXN];
    int Left, Right, Mid;
    
    bool Test(int k){
    	int c=0;
    	for(int i=1;i<=N;++i){
    		c+=Num[i]/k;
    	}
    	return c>=K;
    }
    
    int main(){
    	
    	while(scanf("%d%d", &N, &K)!=EOF){
    		for(int i=1;i<=N;++i){
    			scanf("%lf", &input);
    			Num[i]=(int)(input*100.0);
    		}
    		Left=0;Right=0;
    		for(int i=1;i<=N;++i)	if(Num[i]>Right)	Right=Num[i];
    		while(Left<Right){
    			Mid=(Left+Right)>>1;
    			if(Test(Mid+1))	Left=Mid+1;
    			else	Right=Mid;
    		}
    		Mid=(Left+Right)>>1;
    		printf("%d.%d%d
    ", Mid/100, (Mid/10)%10, Mid%10);
    	}
    	
    	return 0;
    }
    
  • 相关阅读:
    CSPS模拟 65
    CSPS模拟 64
    $color$有色图
    CSPS模拟 63
    CSPS模拟 62
    CSPS模拟 61
    CSPS模拟 60
    CSPS模拟 59
    go中单链表
    MYSQL-联合索引
  • 原文地址:https://www.cnblogs.com/Pickupwin/p/9029198.html
Copyright © 2011-2022 走看看