// TRemainder.cc // TF solution to Remainde From Our Sponsor // 2007 ECNA #include using namespace std; int KeySize=4,BiggestVal; int Key[7], Rem[7]; void Convert(int n , bool blanks){ char a, b, c; if(n%100 == 27) c=' '; else c = (char)(n % 100 - 1 + 'A'); if((n/100) % 100 == 27) b =' '; else b = (char)((n/100) % 100 - 1 + 'A'); if(n/10000 == 27) a = ' '; else a = (char)(n/10000 - 1 + 'A'); if(blanks) //print all chars cout<-1; i--){ k = Key[i]; l= NumDigits(k); //pick off rightnmost l digits of n if(i==0) Rem[0]=n; else{ int m = 1; for(int j=0; j>n; for(int i=0;i>GroupSize; for(int j=0;j>Key[j]; //for(int j=0;j>G; //cout<< "*** "<< G <