Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdlib>
- #include <iomanip>
- #include <string>
- using namespace std;
- int ktrakt(char s)
- {
- if (s=='0') return 0;
- if (s=='1') return 1;
- if (s=='2') return 2;
- if (s=='3') return 3;
- if (s=='4') return 4;
- if (s=='5') return 5;
- if (s=='6') return 6;
- if (s=='7') return 7;
- if (s=='8') return 8;
- if (s=='9') return 9;
- if (s=='A'||s=='a') return 10;
- if (s=='B'||s=='b') return 11;
- if (s=='C'||s=='c') return 12;
- if (s=='D'||s=='d') return 13;
- if (s=='E'||s=='e') return 14;
- if (s=='F'||s=='f') return 15;
- }
- char doikt(int s)
- {
- if (s==0) return '0';
- if (s==1) return '1';
- if (s==2) return '2';
- if (s==3) return '3';
- if (s==4) return '4';
- if (s==5) return '5';
- if (s==6) return '6';
- if (s==7) return '7';
- if (s==8) return '8';
- if (s==9) return '9';
- if (s==10) return 'A';
- if (s==11) return 'B';
- if (s==12) return 'C';
- if (s==13) return 'D';
- if (s==14) return 'E';
- if (s==15) return 'F';
- }
- bool ktrahople(string s,int a)
- {
- int i;
- for(i=0;i<s.length();i++)
- {
- if (ktrakt(s.at(i))>a) return 1;
- }
- }
- int tocs10(string s,int b)
- {
- int i,t=0;
- for(i=0;i<s.length();i++) t=t*b+ktrakt(s.at(i));
- return t;
- }
- // Ham dao chuoi su dung de quy
- string revstr(string s )
- {
- return s.empty() ? s : revstr(s.substr(1))+s[0];
- }
- // ham dao chuoi don gian
- string daochuoi(string s)
- {
- string s1;
- int i;
- for(i=s.length()-1;i>=0;i--)
- {
- s1=s1+s.at(i);
- }
- return s1;
- }
- string cs10to(int a, int b)
- {
- string s="";
- while (a!=0)
- {
- s=s+doikt(a%b);
- a=a/b;
- }
- return revstr(s);
- }
- int main()
- {
- int n,i,a,b;
- string in,out;
- do
- {
- system("cls");
- cout<<"Nhap he co so A va B (A->B): ";
- cin>>a>>b;
- }
- while(a>17||b>17);
- do
- {
- system("cls");
- cout<<"Nhap so can chuyen doi: ";
- cin>>in;
- }
- while(ktrahople(in,a));
- i=tocs10(in,a);
- out=cs10to(i,b);
- cout<<out<<endl;
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment