c语言编程，输入一个十进制数，转换为二，八，十六进制输出，用数组。 两个字符串连接成一个字符串。拜 C语言编程：从键盘上输入一个十进制数，将其转换成八进制数，然...
\u5173\u4e8ec\u8bed\u8a00\u7684\u95ee\u9898\uff0c\u8f93\u51fa\u6570\u7ec4s\u4e2d\u5b57\u7b26\u4e32\uff0c\u5b50\u4e32\u4eces[begin]\u5f00\u59cb\uff0c\u957f\u5ea6\u4e3alen\u3002int location;
for (location = begin; location <= begin + len; location++)
printf("%c", s[location]);
\u9898\u76ee\u7684\u610f\u601d\u597d\u50cf\u662f\u5728\u4e0b\u9762\u6dfb\u52a0\u4ee3\u7801- -\uff1a
for (; len > 0; len--, begin++)
printf("%c", s[begin]);
\u975e\u9012\u5f52\u7b97\u6cd5\uff1a
#include
using namespace std;
#include
#define MAXSIZE 20
typedef struct Stack
{
char node[MAXSIZE];
int top;
}Stack;
int main()
{
Stack s;
s.top=-1;
int n;
cout<<"\u8bf7\u8f93\u5165\u5341\u8fdb\u5236\u6570\uff1a"<<endl;
cin>>n;
int m;
cout<<"\u8bf7\u8f93\u5165\u8981\u8f6c\u5316\u7684\u8fdb\u5236\u6570\uff1a"<<endl;
cin>>m;
int q=n;
while(n!=0)
{
q=n%m;
n=n/m;
s.top++;
if(q<10)
s.node[s.top]=q+48;
else
s.node[s.top]=(q-9)+64;
}
while(s.top>=0)
{
cout<<s.node[s.top--];
}
return 0;
}
\u9012\u5f52\u7b97\u6cd5\uff1a\uff08\u672a\u91c7\u7528\u6570\u7ec4\u5b58\u50a8\uff09
#include
using namespace std;
#define N 8
void print(int M);
int main()
{
print(100);
return 0;
}
void print(int M)
{
int n=M%N;
M=M/N;
if(M!=0)
print(M);
cout<<n;
}
你好，参考如下代码：
#include<iostream>
using namespace std;
#include "string.h"
#include <stdlib.h>
#include <stdio.h>
//10-15数字转换为字母
char i2a(int val)
{
if(val<10 || val>15)
return '0'+ val;
const char* a = {"ABCDEF"};
return a[val-10];
}
int main()
{
while(1)
{
cout<<"输入待转换数字(输入0或负数结束)："<<endl;
int a;
cin>>a;
if(a<=0)
return 0;
cout<<"输入基数(2-16之间)："<<endl;
int b;
cin>>b;
if(b<2 || b>16)
{
cout<<"输入基数错误！"<<endl;
return 0;
}
char c[100];
int i=0;
for(;;)
{
if(a<b)
{
c[i++] = i2a(a);
break;
}
else
{
while(a>=b)
{
int d = a%b;
c[i++] = i2a(d);
a = a/b;
}
c[i++] = i2a(a);
break;
}
}
char d[100];
cout<<"转换后的数字：";
for(int j=0;j<i;j++)
{
d[j] = c[i-j-1];
cout<<d[j];
}
cout<<endl;
//cout<<"转换后的数字："<<d<<endl;
}
}
绛旓細鍙互鍙傝冧笅闈㈢殑浠ｇ爜锛歩nclude <stdio.h> int main(int argc, char* argv[]){ int num;scanf("%d",&num);printf("%o",num);return 0;}
绛旓細//鍗佽繘鍒杞叾瀹冭繘鍒#include <stdio.h>#define charset "0123456789ABCDEFGHIJKLMNOPQ"int longtoother(long x,int n,char *p){//鏁存暟閮ㄥ垎杞崲杩涘埗 锛岃繑鍥鏁板瓧闀垮害 int i=0,k,m,mm;char *pp=p;if (x==0){*p='0'; *(p+1)=0; return 1;}else{while(x!=0){ //i鐢ㄤ簬璁℃暟鍏卞灏...
绛旓細闈為掑綊绠楁硶锛歩nclude <iostream> using namespace std;include <math.h> define MAXSIZE 20 typedef struct Stack { char node[MAXSIZE];int top;}Stack;int main(){ Stack s;s.top=-1;int n;cout<<"璇杈撳叆鍗佽繘鍒舵暟锛"<<endl;cin>>n;int m;cout<<"璇疯緭鍏ヨ杞寲鐨勮繘鍒舵暟锛"<<endl;cin...
绛旓細锛僫nclude锛渟tdio锛巋锛 int main锛堬級锝 int i锛宩锛宯锛宮锛濓紞1锛a锛16锛斤紱printf锛堬紓璇杈撳叆鍗佽繘鍒舵暟锛傦級锛泂canf锛堬紓锛卍锛傦紝锛唍锛夛紱while锛坣锛侊紳0锛夛經 i锛漬锛2锛沘锛伙紜锛媘锛斤紳i锛沶锛漬锛2锛涳綕 for锛坖锛漨锛沯锛烇紳0锛沯锛嶏紞锛塸rintf锛堬紓锛卍锛傦紝a锛籮锛斤級锛況eturn0锛涳綕 ...
绛旓細浠ｇ爜濡備笅锛歩nclude <stdio.h>#include <stdlib.h>int main(){int i = 1;printf("璇杈撳叆涓涓鏁存暟锛");scanf_s("%d", &i);printf("%04x,%04x\n", ((i >> 16) & 0x0000ffff), i & 0x0000ffff);system("pause");return 0;}杩愯缁撴灉锛
绛旓細//C璇█瀹炵幇锛歩nclude<stdio.h> void main(){char b[]="0123456789ABCDEF";long int n,x;int i,a[40];printf("\n Please input n=");scanf("%ld",&n);x=n;i=0;while(x>0){a[i]=x%16;x=x/16;i++;} while(i>0){printf("%c",b[a[i-1]]);i--;} printf("\n")...
绛旓細include<stdio.h> void main(){ int a,sum;printf("璇杈撳叆涓涓崄杩涘埗鏁存暟锛");scanf("%d",&a);int g,s;/* g琛ㄧず涓綅鏁帮紝s琛ㄧず鍗佷綅鏁 */ g=a%10;s=(int)(a/10);sum=g+s;printf("sum is %d\n",sum);}
绛旓細2銆佺劧鍚庡湪璇ョ晫闈腑锛屽厛瀹氫箟鏍堟渶澶х殑瀛樺偍绌洪棿銆2銆佸叾娆″湪璇ョ晫闈腑锛岀紪鍐欏垵濮嬪寲绌烘爤鍑芥暟浠ｇ爜銆3銆佷箣鍚庡湪璇ョ晫闈腑锛岀紪鍐欏垽鏂┖鏍堝嚱鏁颁唬鐮併4銆佹帴鐫鍦ㄨ鐣岄潰涓紝缂栧啓鍒ゆ柇鏍堟弧鍑芥暟浠ｇ爜銆5銆佸叾娆″湪璇ョ晫闈腑锛岀紪鍐欒繘鏍堛佸嚭鏍堝嚱鏁颁唬鐮併6銆佹帴鐫鍦ㄨ鐣岄潰涓锛岀紪鍐欒繘鍒杞寲鍑芥暟浠ｇ爜銆7銆佷箣鍚庡湪璇ョ晫闈腑锛岀紪鍐...
绛旓細int num = 0;scanf("%d", &num);printf("%x", num);return 0;} 绗簩绉嶏細include <stdio.h> include <string.h> char oNumTable[6] = {'A', 'B', 'C', 'D', 'E', 'F'};void dToO(int, char*);int main(){ int dNum;char oNum[100] = {0};//杈撳叆涓涓崄杩涘埗鏁 ...
绛旓細瑕佹妸涓涓崄杩涘埗褰㈠紡鐨勬暣鏁鏁板瓧瀛楃涓诧紝杞崲涓轰竴涓崄杩涘埗鏁存暟锛屽彲浠ョ敤浠ヤ笅鐨勫姙娉曪細char s[]="12345678";int i,n=0;for(i=0;s[i];i++)n=n*10+s[i]-'0';printf("%d",n);杩愯杩欐浠ｇ爜鍚庡彲浠ヨ緭鍑猴細12345678
