2020-12-22

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
void huiwen()
{
	int i,j,length;
	char a[100];
	scanf("%s",a);
	length=strlen(a);
	for(i=0,j=length-1;i<=j;i++,j--)
	{
		if(a[i]!=a[j])
		{
			break;
		}
	}
	if(i<=j)
	{
		printf("no");
	}
	else
	{
		printf("yes");
	}
}
void ab()
{
	int a,b;
	while(scanf("%d %d",&a,&b)!=EOF)
	{
		printf("%d\n",a+b);
	}
}
void erfen()
{
	int a[100],x,n,b;
	printf("请输入你要的元素个数：\n");
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&b);
		a[i]=b;
	}
	printf("请输入你要查找的数字：\n");
	scanf("%d",&x);
	int low,high,mid;
	low=1;
	high=n;
	mid=(low+high)/2;
	if(a[mid]==x)
	{
		printf("yes");
	}
	else
	{
		while(x!=a[mid])
		{
			if(x<a[mid])
			{
				high=mid-1;
			}
			else if(x>a[mid])
			{
				low=mid+1;
			}
			if(low==n||high==1)
			{
				printf("no");
				break;
			}
			mid=(high+low)/2;
		}
		if(x==a[mid])
		{
			printf("yes");
		}
	}
	
}
int kuaipai(int *n,int low,int high)
{
	int key;
	n[0]=n[low];
	key=n[low];
	while(low<high)
	{
		while(low<high&&n[high]>=key)
		{
			--high;
		}
		n[low]=n[high];
		while(low<high&&n[low]<=key)
		{
			++low;
		}
		n[high]=n[low]; 
	}
	n[low]=n[0];
	
	return low;
}
void q(int *n,int low,int high)
{
	int p;
	if(low<high)
	{
		p=kuaipai(n,1,high);
		q(n,low,p-1);
		q(n,p+1,high);
	}
}
void quick()
{
	int n[100];
	int a,x;
	printf("请输入元素个数:\n");
	scanf("%d",&a);
	for(int i=1;i<=a;i++)
	{
		scanf("%d",&x);
		n[i]=x;
	}
	q(n,1,a);
	for(int i=1;i<=a;i++)
	{
		printf("%d ",n[i]);
	}
	
}
void jinzhi()
{
	int x1,x2;
	int i=0;
	printf("请输入你要转换的数与转换的进制:");
	scanf("%d %d",&x1,&x2);
	char b[100];
	char a[16]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
	if(x1<0)
	{
		printf("-");
		x1=fabs(x1);
		while(x1)
		{
			b[i]=a[x1%x2];
			x1=x1/x2;
			i++;
		}
		for(int j=i-1;j>=0;j--)
		{
			printf("%c",b[j]);
		}
	}
	else
	{
		while(x1)
		{
			b[i]=a[x1%x2];
			x1=x1/x2;
			i++;
		}
		for(int j=i-1;j>=0;j--)
		{
			printf("%c",b[j]);
		}
	}
	
}
int main()
{
	jinzhi();
	return 0;
}