View Code of Problem 96

#include <stdio.h>
#include <math.h>
int main(){
	double n;
	while(scanf("%lf",&n)!=EOF&&n!=0){
		char a[2];
		double all,n1,n2;
		scanf("%s",a);
		if(a[0]=='T'){
			n1=n*pow(1024,4);
			n2=n*pow(1000,4);
			all=n1-n2;
		}
		if(a[0]=='G'){
			n1=n*pow(1024,3);
			n2=n*pow(1000,3);
			all=n1-n2;
		}
		if(a[0]=='M'){
			n1=n*pow(1024,2);
			n2=n*pow(1000,2);
			all=n1-n2;
		}
		if(a[0]=='K'){
			n1=n*pow(1024,1);
			n2=n*pow(1000,1);
			all=n1-n2;
		}
		if(a[0]=='B'){
			all=0;
		}
		printf("%lf\n",all);
	}
	return 0;
}