poj 1220 NUMBER BASE CONVERSION

NUMBER BASE CONVERSION

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5976		Accepted: 2738

Description

Write a program to convert numbers in one base to numbers in a second base. There are 62 different digits: 
{ 0-9,A-Z,a-z } 
HINT: If you make a sequence of base conversions using the output of one conversion as the input to the next, when you get back to the original base, you should get the original number. 

Input

The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines will have a (decimal) input base followed by a (decimal) output base followed by a number expressed in the input base. Both the input base and the output base will be in the range from 2 to 62. That is (in decimal) A = 10, B = 11, ..., Z = 35, a = 36, b = 37, ..., z = 61 (0-9 have their usual meanings). 

Output

The output of the program should consist of three lines of output for each base conversion performed. The first line should be the input base in decimal followed by a space then the input number (as given expressed in the input base). The second output line should be the output base followed by a space then the input number (as expressed in the output base). The third output line is blank. 

Sample Input

8
62 2 abcdefghiz
10 16 1234567890123456789012345678901234567890
16 35 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2
35 23 333YMHOUE8JPLT7OX6K9FYCQ8A
23 49 946B9AA02MI37E3D3MMJ4G7BL2F05
49 61 1VbDkSIMJL3JjRgAdlUfcaWj
61 5 dl9MDSWqwHjDnToKcsWE1S
5 10 42104444441001414401221302402201233340311104212022133030

Sample Output

62 abcdefghiz
2 11011100000100010111110010010110011111001001100011010010001

10 1234567890123456789012345678901234567890
16 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2

16 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2
35 333YMHOUE8JPLT7OX6K9FYCQ8A

35 333YMHOUE8JPLT7OX6K9FYCQ8A
23 946B9AA02MI37E3D3MMJ4G7BL2F05

23 946B9AA02MI37E3D3MMJ4G7BL2F05
49 1VbDkSIMJL3JjRgAdlUfcaWj

49 1VbDkSIMJL3JjRgAdlUfcaWj
61 dl9MDSWqwHjDnToKcsWE1S

61 dl9MDSWqwHjDnToKcsWE1S
5 42104444441001414401221302402201233340311104212022133030

5 42104444441001414401221302402201233340311104212022133030
10 1234567890123456789012345678901234567890

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 //#include<vector>
 //#include<queue>
 //#include<set>
 #define INF 0x3f3f3f3f
 #define N 100005
 #define re register
 #define Ii inline int
 #define Il inline long long
 #define Iv inline void
 #define Ib inline bool
 #define Id inline double
 #define ll long long
 #define Fill(a,b) memset(a,b,sizeof(a))
 #define R(a,b,c) for(register int a=b;a<=c;++a)
 #define nR(a,b,c) for(register int a=b;a>=c;--a)
 #define Min(a,b) ((a)<(b)?(a):(b))
 #define Max(a,b) ((a)>(b)?(a):(b))
 #define Cmin(a,b) ((a)=(a)<(b)?(a):(b))
 #define Cmax(a,b) ((a)=(a)>(b)?(a):(b))
 #define D_e(x) printf("\n&__ %d __&\n",x)
 #define D_e_Line printf("-----------------\n")
 #define D_e_Matrix for(re int i=1;i<=n;++i){for(re int j=1;j<=m;++j)printf("%d ",g[i][j]);putchar('\n');}
 using namespace std;
 //The Code Below Is Bingoyes's Function Forest.
 Ii read(){
     int s=,f=;char c;
     for(c=getchar();c>''||c<'';c=getchar())if(c=='-')f=-;
     while(c>=''&&c<='')s=s*+(c^''),c=getchar();
     return s*f;
 }
 Iv print(int x){
     if(x<)putchar('-'),x=-x;
     if(x>)print(x/);
     putchar(x%^'');
 }
 /*
 Iv Floyd(){
     R(k,1,n)
         R(i,1,n)
             if(i!=k&&dis[i][k]!=INF)
                 R(j,1,n)
                     if(j!=k&&j!=i&&dis[k][j]!=INF)
                         Cmin(dis[i][j],dis[i][k]+dis[k][j]);
 }
 Iv Dijkstra(int st){
     priority_queue<int>q;
     R(i,1,n)dis[i]=INF;
     dis[st]=0,q.push((nod){st,0});
     while(!q.empty()){
         int u=q.top().x,w=q.top().w;q.pop();
         if(w!=dis[u])continue;
         for(re int i=head[u];i;i=e[i].nxt){
             int v=e[i].pre;
             if(dis[v]>dis[u]+e[i].w)
                 dis[v]=dis[u]+e[i].w,q.push((nod){v,dis[v]});
         }
     }
 }
 Iv Count_Sort(int arr[]){
     int k=0;
     R(i,1,n)
         ++tot[arr[i]],Cmax(mx,a[i]);
     R(j,0,mx)
         while(tot[j])
             arr[++k]=j,--tot[j];
 }
 Iv Merge_Sort(int arr[],int left,int right,int &sum){
     if(left>=right)return;
     int mid=left+right>>1;
     Merge_Sort(arr,left,mid,sum),Merge_Sort(arr,mid+1,right,sum);
     int i=left,j=mid+1,k=left;
     while(i<=mid&&j<=right)
         (arr[i]<=arr[j])?
             tmp[k++]=arr[i++]:
             (tmp[k++]=arr[j++],sum+=mid-i+1);//Sum Is Used To Count The Reverse Alignment
     while(i<=mid)tmp[k++]=arr[i++];
     while(j<=right)tmp[k++]=arr[j++];
     R(i,left,right)arr[i]=tmp[i];
 }
 Iv Bucket_Sort(int a[],int left,int right){
     int mx=0;
     R(i,left,right)
         Cmax(mx,a[i]),++tot[a[i]];
     ++mx;
     while(mx--)
         while(tot[mx]--)
             a[right--]=mx;
 }
 */
 char number[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz",str[N],str_new[N];
 int main(){
     int T=read();
     while(T--){
         int a=read(),b=read();
         scanf("%s",str),
         printf("%d %s\n",a,str);
         int len=strlen(str),flag=,digit=;
         while(flag){
             flag=;
             int res=;
             R(i,,len-){
                 int num;
                 if(str[i]>=''&&str[i]<='')num=str[i]^'';
                 if(str[i]>='A'&&str[i]<='Z')num=str[i]-'A'+;
                 if(str[i]>='a'&&str[i]<='z')num=str[i]-'a'+;
                 num+=res*a,res=num%b,str[i]=number[num/b];
                 if(str[i]!='')
                     flag=;
             }
             str_new[++digit]=number[res];
         }
         printf("%d ", b);
         nR(i,digit,)
             printf("%c",str_new[i]);
         printf("\n\n");
     }
     return ;
 }
 /*
     Note:
         There is always a truth: High precision is the descendants of Satan.
 */