hdu 4788 Hard Disk Drive (水题)

题意:

Input
  The first line contains an integer T, which indicates the number of test cases.   For each test case, there is one line contains a string in format “number[unit]” where number is a positive integer within [1, 1000] and unit is the description of size which could be “B”, “KB”, “MB”, “GB”, “TB”, “PB”, “EB”, “ZB”, “YB” in short respectively.

 

Output
  For each test case, output one line “Case #x: y”, where x is the case number (starting from 1) and y is the percentage of the “missing part”. The answer should be rounded to two digits after the decimal point.

 

Sample Input
2 100[MB] 1[B]
 

 

Sample Output
Case #1: 4.63% Case #2: 0.00%

 

代码:

int T;
char s[100];

ll Pow(int a,int x){
    ll res = 1;
    rep(i,1,x) res *= (ll)a;
    return res;
}
int main(){
    cin >> T;
    rep(t,1,T){
        scanf("%s",s);
        int l = strlen(s);
        char x = s[l-3];
        int a;
        switch(x){
            case '[': a=0; break;
            case 'K': a=1; break;
            case 'M': a=2; break;
            case 'G': a=3; break;
            case 'T': a=4; break;
            case 'P': a=5; break;
            case 'E': a=6; break;
            case 'Z': a=7; break;
            case 'Y': a=8; break;
        }
        ll A = Pow(125,a), B = Pow(128,a);
        //printf("%I64d %I64d\n",A,B);
        double ans = (double)100 - ((double)A*100/(double)B);
        printf("Case #%d: %.2lf%%\n",t,ans);
    }
}

 

转载于:https://www.cnblogs.com/fish7/p/4083519.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值