逆序五进制
题目
//逆序五进制
//输入十进制 去掉前导零 逆序后 再求五进制
//如 1000 1000 0001 1
//下面的代码测试用例全部AC
#include<iostream>
#include<string>
#include<cmath>
using namespace std;
long long int stringtonum(const string revshi)//将字符串转换为longlong int型
{
long long int a = 0;
int length = revshi.size();
for (int i = 0; i < length; i++)
{
a = a + (revshi[i] - '0')*pow(10, length - 1 - i);
}
return a;
}
string changetofive(const long long int num)//将十进制数转换为5进制
{
long long int bcs = num;//被除数
string five = "";
long long int shan=0;
long long int yushu=0;
while (1)
{
if (bcs >= 5)
{
shan = bcs / 5;
yushu = bcs - shan * 5;
five = five + char(yushu + int('0'));
bcs = shan;
}
else
{
five = five + char(bcs + int('0'));
break;
}
}
//cout << "逆序5进制为:" << five;
string key = "";
for (int i = five.size() - 1; i >= 0; i--)
{
key = key + five[i];
}
//cout<<"key为:"<<key;
return key;
}
int main()
{
string virualshi;
string shi="";
int index=0;//十进制真正的开始位置
cin >> virualshi;
for (int i = 0; i < virualshi.size(); i++)
{
if (virualshi[i] != '0')
{
index = i;
break;
}
}
for (int i = index; i < virualshi.size(); i++)
{
shi = shi + virualshi[i];
}
//cout << "去除前导0的十进制是:" << shi<<endl;
string revshi = "";
for (int i = shi.size() - 1; i >= 0; i--)
{
revshi = revshi + shi[i];
}
//cout << "逆序十进制为:" << revshi << endl;
long long int num =stringtonum(revshi);//将字符串转换为longlong int型
//cout << "十进制int为:" << num <<endl;
string key=changetofive(num);//将十进制数转换为5进制
cout<<key;
return 0;
}