View Code of Problem 96

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long tmp;
	char s[10];
	while(scanf("%s",s)!=EOF){
		long long t2 = 0,t1 = 0,n = 0;
		char c;
		if(s[0] == 48)return 0;
		for(int i = 0;i<strlen(s);i++){
			if(!(s[i]>='0' && s[i]<='9')){
				c = s[i];
				break;
			}
			n = n * 10 + (s[i]-'0');
		}
//		cout<<c<<" "<<n<<endl;	
		switch(c){
			case 'M':{
				t1 = n * 1000*1000;
				t2 = n*1024*1024;
				break;
			}
			case 'G':{
				t1 = n*1000*1000*1000;
				t2 = n*1024*1024*1024;
				break;
			}
			case 'T':{
				t1 = n*1000*1000*1000*1000;
				t2 = n*1024*1024*1024*1024;
				break;
			}
			case 'K':{
				t1 = n*1000;
				t2 = n*1024;
				break;
			}
		}
		cout<<t2-t1<<endl;	
	}
	return 0;
}