用C编程，输入一个十进制的数转化为二进制的数输出 c语言问题：输入一个十进制数，将其转化为二进制数后存放在数组...
c\u8bed\u8a00\u7f16\u7a0b\u5b9e\u73b0\u4ece\u952e\u76d8\u4e0a\u8f93\u5165\u4e00\u4e2a\u4e8c\u8fdb\u5236\u6574\u6570\u5f62\u5f0f\u7684\u5b57\u7b26\u4e32\uff0c\u5c06\u5176\u8f6c\u5316\u4e3a\u5341\u8fdb\u5236\u6574\u6570\u8f93\u51fa#include "stdio.h"
int main(int argc,char *argv[]){
char d[33];
int i,t;
printf("Please enter a string composed of '0' and '1'...\n");
if(scanf("%32[01]",d)==1){
for(t=i=0;d[i];(t*=2)+=d[i++]-'0');
printf("%s(2) --> %d(10)\n",d,t);
}
else
printf("Input error, exit...\n");
return 0;
}
\u4ee3\u7801\u683c\u5f0f\u548c\u8fd0\u884c\u6837\u4f8b\u56fe\u7247\uff1a
#include<stdio.h>
#define uint unsigned int
#define ushort unsigned short
//\u6c422\u7684N\u6b21\u65b9
int cifang(int n)
{
int i=0,sum=1;
for(i=n;i>0;i--)
{
sum*=2;
}
return sum;
}
//\u5341\u8fdb\u5236\u6b63\u6570\u8f6c\u6362\u6210\u4e8c\u8fdb\u5236\u6570
uint transform_data_zhengshu(uint frequence,ushort*pwm_table)
{
uint temp=frequence;
int pwm_index=0;
while(temp)
{
pwm_table[pwm_index]=(temp&0x01);
temp=temp>>1;
pwm_index++;
}
return pwm_index-1;
}
uint transform_data(int frequence,ushort*pwm_table)
{
int temp=frequence;
int pwm_index=0;
ushort pwm_temp[15]={0};
//\u8d1f\u6570
if(frequence<0)
{
//\u5148\u5c06\u8d1f\u6570\u8f6c\u6362\u6210\u6b63\u6570
temp=-frequence;
//\u6c42\u51fa\u8fd9\u4e2a\u6b63\u6570temp\u7684\u4e8c\u8fdb\u5236\u5e76\u5b58\u653e\u5728pwm_temp\u4e2d
transform_data_zhengshu(temp,pwm_temp);
//\u5c06\u8fd9\u4e2a\u6b63\u6570temp\u7684\u4e8c\u8fdb\u5236pwm_temp\u53d6\u53cd\u5e76\u8f6c\u6362\u6210\u5341\u8fdb\u5236\u6570sum
int sum=0;
int i=0;
for(i=0;i<15;i++)
{
if(pwm_temp<i>==0)
pwm_temp<i>=1;
else
pwm_temp<i>=0;
sum+=cifang(i)*pwm_temp<i>;
pwm_temp<i>=0;
}
//\u5c06\u8f6c\u6362\u51fa\u6765\u7684\u5341\u8fdb\u5236\u6570sum\u52a0\u4e00
sum+=1;
//printf("sum=%d\n",sum);
//\u6700\u540e\u518d\u8f6c\u6210\u4e8c\u8fdb\u5236pwm_table
return transform_data_zhengshu(sum,pwm_table);
}
//\u6b63\u6570
return transform_data_zhengshu(frequence,pwm_table);
}
int main(){
int frequence=-2;
//scanf("%d",&frequence);
ushort pwm_table[15]={0};
uint off_set;
off_set=transform_data(frequence,pwm_table);
int i=0;
for(i=off_set;i>=0;i--)
{
printf("%d",pwm_table<i>);
}
return 0;
}
\u6269\u5c55\u8d44\u6599\uff1a\u2460printf()\u51fd\u6570\u662f\u683c\u5f0f\u5316\u8f93\u51fa\u51fd\u6570,\u4e00\u822c\u7528\u4e8e\u5411\u6807\u51c6\u8f93\u51fa\u8bbe\u5907\u6309\u89c4\u5b9a\u683c\u5f0f\u8f93\u51fa\u4fe1\u606f\u3002
\u683c\u5f0f\u8f93\u51fa\uff0c\u5b83\u662fc\u8bed\u8a00\u4e2d\u4ea7\u751f\u683c\u5f0f\u5316\u8f93\u51fa\u7684\u51fd\u6570\uff08\u5728stdio.h\u4e2d\u5b9a\u4e49\uff09\u3002\u7528\u4e8e\u5411\u7ec8\u7aef\uff08\u663e\u793a\u5668\u3001\u63a7\u5236\u53f0\u7b49\uff09\u8f93\u51fa\u5b57\u7b26\u3002\u683c\u5f0f\u63a7\u5236\u7531\u8981\u8f93\u51fa\u7684\u6587\u5b57\u548c\u6570\u636e\u683c\u5f0f\u8bf4\u660e\u7ec4\u6210\u3002
\u8981\u8f93\u51fa\u7684\u6587\u5b57\u9664\u4e86\u53ef\u4ee5\u4f7f\u7528\u5b57\u6bcd\u3001\u6570\u5b57\u3001\u7a7a\u683c\u548c\u4e00\u4e9b\u6570\u5b57\u7b26\u53f7\u4ee5\u5916\uff0c\u8fd8\u53ef\u4ee5\u4f7f\u7528\u4e00\u4e9b\u8f6c\u4e49\u5b57\u7b26\u8868\u793a\u7279\u6b8a\u7684\u542b\u4e49\u3002
\u7b80\u5355\u70b9\u7406\u89e3\u5c31\u662f\uff0c\u5728\u4e00\u6bb5\u7a0b\u5e8f\u4e2d\u4f60\u6b63\u786e\u4f7f\u7528\u8be5\u51fd\u6570\uff0c\u53ef\u4ee5\u5728\u8be5\u7a0b\u5e8f\u8fd0\u884c\u7684\u65f6\u5019\u8f93\u51fa\u4f60\u6240\u9700\u8981\u7684\u5185\u5bb9\u3002
\u2461printf\u51fd\u6570\u662f\u4e00\u4e2a\u6807\u51c6\u5e93\u51fd\u6570\uff0c\u5b83\u7684\u51fd\u6570\u539f\u578b\u5728\u5934\u6587\u4ef6\u201cstdio.h\u201d\u4e2d\u3002\u4f46\u4f5c\u4e3a\u4e00\u4e2a\u7279\u4f8b\uff0c\u4e0d\u8981\u6c42\u5728\u4f7f\u7528printf\u51fd\u6570\u4e4b\u524d\u5fc5\u987b\u5305\u542bstdio.h\u6587\u4ef6\u3002
printf()\u51fd\u6570\u7684\u8c03\u7528\u683c\u5f0f\u4e3a:printf("<\u683c\u5f0f\u5316\u5b57\u7b26\u4e32>",<\u53c2\u91cf\u8868>)\u3002
\u5176\u4e2d\u683c\u5f0f\u5316\u5b57\u7b26\u4e32\u7528\u4e8e\u6307\u5b9a\u8f93\u51fa\u683c\u5f0f\u3002\u683c\u5f0f\u63a7\u5236\u4e32\u53ef\u7531\u683c\u5f0f\u5b57\u7b26\u4e32\u548c\u975e\u683c\u5f0f\u5b57\u7b26\u4e32\u4e24\u79cd\u7ec4\u6210\u3002
\u683c\u5f0f\u5b57\u7b26\u4e32\u662f\u4ee5%\u5f00\u5934\u7684\u5b57\u7b26\u4e32\uff0c\u5728%\u540e\u9762\u8ddf\u6709\u5404\u79cd\u683c\u5f0f\u5b57\u7b26\uff0c\u4ee5\u8bf4\u660e\u8f93\u51fa\u6570\u636e\u7684\u7c7b\u578b\u3001\u5f62\u5f0f\u3001\u957f\u5ea6\u3001\u5c0f\u6570\u4f4d\u6570\u7b49\u3002
\u5982\u201c%d\u201d\u8868\u793a\u6309\u5341\u8fdb\u5236\u6574\u578b\u8f93\u51fa\uff0c\u201c%ld\u201d\u8868\u793a\u6309\u5341\u8fdb\u5236\u957f\u6574\u578b\u8f93\u51fa\uff0c\u201c%C\u201d\u8868\u793a\u6309\u5b57\u7b26\u578b\u8f93\u51fa\u7b49\u3002
你好！
完整的代码：
#include<stdio.h>
int main()
{
int num;
int n,z[30];
scanf("%d",&num);
for(n=0;n>=0;n++)
{
z[n]=num%2;
if(num/2==0) break;
num=num/2;
}
for(;n>=0;n--)
{
printf("%d",z[n]);
}
}
#include<stdio.h>
int main()
{
int n,i;
printf("请输入一个十进制数:");
scanf("%d",&n);
int m[100];
for(i=0;n!=0;i++) //辗转相除，2进制数存入数组m[100]
{
m[i]=n%2;
n=(int)(n/2);
}
while(i-1>=0) //将m[100]中的2进制输出
{
printf("%d",m[i-1]);
i--;
}
return 0;
}
#include<stdio.h>
void main()
{ int i,s=0,n;
unsigned int x;
scanf("%d",&n);
for ( i=0,x=0x80000000;i<32;i++,x>>=1 )
if ( n&x ) { s=1; printf("1"); }
else if ( s ) printf("0"); //去掉前导0
printf("\n");
}
十进制转化二进制有自己的算法，楼主记住就好了。
绛旓細姹鍗佽繘鍒惰浆鎹浜岃繘鍒C璇█浠ｇ爜浠ｇ爜濡備笅: #include<stdio.h> #define NR(sizeof(int)*8) //浜岃繘鍒朵綅鐨勪釜鏁 voiddeciToBin(intnum);//鍗佽繘鍒惰浆鎹负浜岃繘鍒跺嚱鏁板０鏄 /*涓诲嚱鏁*/ intmain(void) { intnum; fprintf(stdout,"璇杈撳叆涓涓姝ｆ暣鏁:"); /*鑾峰彇骞舵鏌ョ敤鎴疯緭鍏*/ while(1) { if(fscanf(stdin,...
绛旓細浠ヤ笅绋嬪簭瀹炵幇涓涓崄杩涘埗鏁鍒颁簩杩涘埗鏁扮殑杞崲(璇ュ崄杩涘埗鏁板彲浠ユ槸姝ｆ暟锛屽皬鏁帮紝璐熸暟鍜屾暣鏁)锛屾簮绋嬪簭濡備笅锛歩nclude<stdio.h> include<math.h> void main(){ int i=0,n,j,a[20],b[20],k,c=0;double m,x,d;printf("璇杈撳叆闇瑕杞崲鐨勬暟:");scanf("%lf",&x);if(x<0)m=fabs(x);else m...
绛旓細out[1] = 0;} else { for (n = 0; n < i/2; n++) { temp = out[n];out[n]=out[i - n - 1];out[i - n - 1] = temp;} } } int main(){ unsigned int d;char t[33];scanf_s("%u", &d);convert(d, 2, t);printf("浜杩涘埗锛%s\n", t);convert(d, 8,...
绛旓細include"stdio.h"main(){ int i;printf("enter a number");scanf("%d",&i);printf("\n鍏杩涘埗涓%o",i);printf("\n鍗佸叚杩涘埗涓%x",i);}
绛旓細include <stdio.h> int transfer(int x){ int p=1,y=0,yushu;while(1){ yushu=x%2;x/=2;y+=yushu*p;p*=10;if(x<2){ y+=x*p;break;} } return y;} void main(){ //杩涘埗杞崲鍑芥暟鐨勫０鏄 int transfer(int x);int x;printf("璇杈撳叆涓涓崄杩涘埗鏁:");scanf("%d",&x);pri...
绛旓細"string.h"#include <stdlib.h>#include <stdio.h>//10-15鏁板瓧杞崲涓哄瓧姣峜har 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鎴栬礋鏁扮粨鏉)锛"...
绛旓細鍗佽繘鍒舵暟杞崲涓轰簩杩涘埗鏁扮殑浠ｇ爜涓猴細include 銆坕ostream銆塱nclude 銆坆itset銆塱nt main(){ int num;cout<<bitset<sizeof(num)*8>(num)<<endl;return 0;} 鎵╁睍璧勬簮锛氫唬鐮佷腑鎵浣跨敤鐨勫簱鍑芥暟-bitset锛欳++璇█鐨勪竴涓绫诲簱锛岀敤鏉ユ柟渚垮湴绠＄悊涓绯诲垪鐨刡it浣嶈屼笉鐢ㄧ▼搴忓憳鑷繁鏉ュ啓浠ｇ爜銆俠itset闄や簡鍙互璁块棶鎸囧畾涓嬫爣...
绛旓細scanf("%d",&x); /*杈撳叆涓涓崄杩涘埗鏁板瓧*/ k=-1;/*灏-1璧嬬粰k*/ 4銆佺敤闄鍙栦綑鍊掕娉曞皢鍗佽繘鍒剁殑鏁拌浆鍖鎴愪簩杩涘埗鐨勬暟锛歞o/*鐢ㄥ惊鐜皢鍗佽繘鍒剁殑鏁拌浆鍖栨垚浜岃繘鍒剁殑鏁*/ { r=x%2;/*鐢ㄩ櫎R鍙栦綑鍊掕娉曡绠椾簩杩涘埗*/ b[++k]=r;/*灏嗗艰祴缁欐暟缁*/ x/=2;/*灏嗗師鏁伴櫎2*/ }while(x...
绛旓細=N[x%n];x/=n;}for(i=total-1;i>=0;i--){p[total-1-i]=tmp[i];}if(total==0){p[0]='0';p[1]=0;}elsep[total-1-i]=0;}int main(){char s[100];//鐢ㄤ簬瀛樻斁杞崲鐨勮繘鍒剁殑鏁int i,x; printf("鎶涓涓暟杞崲鎴2 3 4 ... 16杩涘埗鏁癨n");scanf("%d",&x);...
绛旓細闈為掑綊绠楁硶锛歩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...
