题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4788
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<list>
#define mem(x,y)memset(x,y,sizeof(x))
#define max(a,b)(a)>(b)?(a):(b)
#define min(a,b)(a)<(b)?(a):(b)
#define eps 1e-10
#define M 100000007
#define INF 0x1f1f1f1f
using namespace std;
typedef long long int LL;
typedef __int64 ll;
const int maxn=1005;
char c[505];
char c1[505]={'B','K','M','G','T','P','E','Z','Y'};
int main()
{
double s;
int T,a,flag=0;
scanf("%d",&T);
while(T--)
{
flag++;
s=1;
scanf("%d[%s]",&a,c);
double f=1000/(1024*1.0);
for(int i=0;i<500;i++)
{
if(c[0]==c1[i])
break;
s=s*f;
}
printf("Case #%d: %.2lf%%\n",flag,(1-s)*100);
}
return 0;
}