Yesterday your dear cousin Coach Pang gave you a new 100MB hard disk drive (HDD) as a gift because you will get married next year.
But you turned on your computer and the operating system (OS) told you the HDD is about 95MB. The 5MB of space is missing. It is known that the HDD manufacturers have a different capacity measurement. The manufacturers think 1 “kilo” is 1000 but the OS thinks that is 1024. There are several descriptions of the size of an HDD. They are byte, kilobyte, megabyte, gigabyte, terabyte, petabyte, exabyte, zetabyte and yottabyte. Each one equals a “kilo” of the previous one. For example 1 gigabyte is 1 “kilo” megabytes.
Now you know the size of a hard disk represented by manufacturers and you want to calculate the percentage of the “missing part”.
But you turned on your computer and the operating system (OS) told you the HDD is about 95MB. The 5MB of space is missing. It is known that the HDD manufacturers have a different capacity measurement. The manufacturers think 1 “kilo” is 1000 but the OS thinks that is 1024. There are several descriptions of the size of an HDD. They are byte, kilobyte, megabyte, gigabyte, terabyte, petabyte, exabyte, zetabyte and yottabyte. Each one equals a “kilo” of the previous one. For example 1 gigabyte is 1 “kilo” megabytes.
Now you know the size of a hard disk represented by manufacturers and you want to calculate the percentage of the “missing part”.
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.
2 100[MB] 1[B]
Case #1: 4.63%
Case #2: 0.00%
简单题,计算概率
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#define mem(n, m) memset(n, m, sizeof(n));
const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 10;
using namespace std;
string ss[111] = {"B", "KB", "MB", "GB", "TB", "PB", "EB", "ZB", "YB"};
int main()
{
int Case = 0, n;
string str;
scanf("%d", &n);
while (n --)
{
cin >> str;
int len = str.size();
if (str[len - 2] == 'B' && str[len - 3] == '[')
{
printf("Case #%d: %.2f%%\n", ++Case, 0.0);
continue;
}
string s;
s += str[len - 3];
s += str[len - 2];
int num = 0;
for (int i = 0; i < 11; i ++)
if (ss[i] == s)
{
num = i;
break;
}
double sum = 1.0;
for (int i = num; i > 0; i --)
sum *= 1000.0 / 1024.0;
printf("Case #%d: %.2f%%\n", ++Case, (1 - sum) * 100);
}
return 0;
}