View Code of Problem 96

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
    double m,t=0,a=1024,b=1000;
    char n[999];
    while(cin>>m>>n){
        if(m==0)
            break;
    switch(n[0]){
        case 'B':t=0;
            break;
        case 'K':t=m*(a-b);
            break;
        case 'M':t=m*(pow(a,2)-pow(b,2));
            break;
        case 'G':t=m*(pow(a,3)-pow(b,3));
            break;
        case 'T':t=m*(pow(a,4)-pow(b,4));
            break;
    }
    cout<<t<<endl;
    }
    return 0;
}