c语言题：输入一个整数，分别用无符号方式、八进制方式、十六进制方式输出
c\u8bed\u8a00\u9898\u76ee \u4ee5\u5b57\u7b26\u5f62\u5f0f\u8f93\u5165\u4e00\u4e2a\u5341\u516d\u8fdb\u5236\u6570,\u5c06\u5176\u53d8\u6362\u6210\u4e00\u4e2a\u5341\u8fdb\u5236\u6574\u6570\u540e\u8f93\u51fa#include #include #include int main(void){ long int digital, len, times; char ch[50]; while (true) { fputs("\u8bf7\u8f93\u5165\u4e00\u4e2a\u5341\u516d\u8fdb\u5236\u6570\u5b57 : ", stdout); gets(ch); for (times = 1, len = strlen(ch) - 1, digital = 0; len >= 0; --len) { ch[len] = tolower(ch[len]); if (ch[len] >= 'a' && ch[len] <= 'f') digital += (ch[len] - 87) * times; else if (isdigit(ch[len])) digital += (ch[len] - 48) * times; else { puts("\u65e0\u6cd5\u8bc6\u522b\u7684\u5341\u516d\u8fdb\u5236!"); break; } times *= 16; } printf("%s = %d\n\n", ch, digital); } return 0;}
#include #define N 8 void tran(int num,int k) {int arr[N],i;for (i=0;i =0;i--)switch (arr[i]){case 10: printf("A");break;case 11: printf("B");break;case 12: printf("C");break;case 13: printf("D");break;case 14: printf("E");break;case 15: printf("F");break;default: printf("%d",arr[i]);}printf("\n\n\n"); } int main() {int num,choo; loop: printf("\u8bf7\u9009\u62e9\u529f\u80fd\uff1a0.\u9000\u51fa 1.\u5341\u8fdb\u5236\u8f6c\u4e8c\u8fdb\u5236 2.\u5341\u8fdb\u5236\u8f6c\u516b\u8fdb\u5236 3.\u5341\u8fdb\u5236\u8f6c\u5341\u516d\u8fdb\u5236\n");scanf("%d",&choo);switch (choo){case 1:printf("\u8bf7\u8f93\u5165\u8981\u8f6c\u6362\u7684\u5341\u8fdb\u5236\u6570\uff1a");scanf("%d",&num);tran (num,2);goto loop;case 2:printf("\u8bf7\u8f93\u5165\u8981\u8f6c\u6362\u7684\u5341\u8fdb\u5236\u6570\uff1a");scanf("%d",&num);tran (num,8);goto loop;case 3:printf("\u8bf7\u8f93\u5165\u8981\u8f6c\u6362\u7684\u5341\u8fdb\u5236\u6570\uff1a");scanf("%d",&num);tran (num,16);goto loop;case 0:break;
default :printf("\u8f93\u5165\u6709\u8bef\uff01\u8bf7\u91cd\u65b0\u8f93\u5165\uff01\n");goto loop;}}
\u62d3\u5c55\u8d44\u6599
C\u8bed\u8a00\u662f\u4e00\u95e8\u901a\u7528\u8ba1\u7b97\u673a\u7f16\u7a0b\u8bed\u8a00\uff0c\u5e7f\u6cdb\u5e94\u7528\u4e8e\u5e95\u5c42\u5f00\u53d1\u3002C\u8bed\u8a00\u7684\u8bbe\u8ba1\u76ee\u6807\u662f\u63d0\u4f9b\u4e00\u79cd\u80fd\u4ee5\u7b80\u6613\u7684\u65b9\u5f0f\u7f16\u8bd1\u3001\u5904\u7406\u4f4e\u7ea7\u5b58\u50a8\u5668\u3001\u4ea7\u751f\u5c11\u91cf\u7684\u673a\u5668\u7801\u4ee5\u53ca\u4e0d\u9700\u8981\u4efb\u4f55\u8fd0\u884c\u73af\u5883\u652f\u6301\u4fbf\u80fd\u8fd0\u884c\u7684\u7f16\u7a0b\u8bed\u8a00\u3002
\u5c3d\u7ba1C\u8bed\u8a00\u63d0\u4f9b\u4e86\u8bb8\u591a\u4f4e\u7ea7\u5904\u7406\u7684\u529f\u80fd\uff0c\u4f46\u4ecd\u7136\u4fdd\u6301\u7740\u826f\u597d\u8de8\u5e73\u53f0\u7684\u7279\u6027\uff0c\u4ee5\u4e00\u4e2a\u6807\u51c6\u89c4\u683c\u5199\u51fa\u7684C\u8bed\u8a00\u7a0b\u5e8f\u53ef\u5728\u8bb8\u591a\u7535\u8111\u5e73\u53f0\u4e0a\u8fdb\u884c\u7f16\u8bd1\uff0c\u751a\u81f3\u5305\u542b\u4e00\u4e9b\u5d4c\u5165\u5f0f\u5904\u7406\u5668\uff08\u5355\u7247\u673a\u6216\u79f0MCU\uff09\u4ee5\u53ca\u8d85\u7ea7\u7535\u8111\u7b49\u4f5c\u4e1a\u5e73\u53f0\u3002
\u4e8c\u5341\u4e16\u7eaa\u516b\u5341\u5e74\u4ee3\uff0c\u4e3a\u4e86\u907f\u514d\u5404\u5f00\u53d1\u5382\u5546\u7528\u7684C\u8bed\u8a00\u8bed\u6cd5\u4ea7\u751f\u5dee\u5f02\uff0c\u7531\u7f8e\u56fd\u56fd\u5bb6\u6807\u51c6\u5c40\u4e3aC\u8bed\u8a00\u5236\u5b9a\u4e86\u4e00\u5957\u5b8c\u6574\u7684\u7f8e\u56fd\u56fd\u5bb6\u6807\u51c6\u8bed\u6cd5\uff0c\u79f0\u4e3aANSI C\uff0c\u4f5c\u4e3aC\u8bed\u8a00\u6700\u521d\u7684\u6807\u51c6\u3002 \u76ee\u524d2011\u5e7412\u67088\u65e5\uff0c\u56fd\u9645\u6807\u51c6\u5316\u7ec4\u7ec7\uff08ISO\uff09\u548c\u56fd\u9645\u7535\u5de5\u59d4\u5458\u4f1a\uff08IEC\uff09\u53d1\u5e03\u7684C11\u6807\u51c6\u662fC\u8bed\u8a00\u7684\u7b2c\u4e09\u4e2a\u5b98\u65b9\u6807\u51c6\uff0c\u4e5f\u662fC\u8bed\u8a00\u7684\u6700\u65b0\u6807\u51c6\uff0c\u8be5\u6807\u51c6\u66f4\u597d\u7684\u652f\u6301\u4e86\u6c49\u5b57\u51fd\u6570\u540d\u548c\u6c49\u5b57\u6807\u8bc6\u7b26\uff0c\u4e00\u5b9a\u7a0b\u5ea6\u4e0a\u5b9e\u73b0\u4e86\u6c49\u5b57\u7f16\u7a0b\u3002
C\u8bed\u8a00\u662f\u4e00\u95e8\u9762\u5411\u8fc7\u7a0b\u7684\u8ba1\u7b97\u673a\u7f16\u7a0b\u8bed\u8a00\uff0c\u4e0eC++\uff0cJava\u7b49\u9762\u5411\u5bf9\u8c61\u7684\u7f16\u7a0b\u8bed\u8a00\u6709\u6240\u4e0d\u540c\u3002
\u5176\u7f16\u8bd1\u5668\u4e3b\u8981\u6709Clang\u3001GCC\u3001WIN-TC\u3001SUBLIME\u3001MSVC\u3001Turbo C\u7b49\u3002
\uff08\u53c2\u8003\u8d44\u6599 \u767e\u5ea6\u767e\u79d1 C\u8bed\u8a00\uff09
int main()
{
int a;
scanf("%d", &a);
printf("%u, %o,%x", a, a, a);
}
绛旓細void main(){ int input = 0; scanf("%d",&input); int x = input % 10; int y = input / 10 % 10; int z = input / 100; printf("%d,%d,%d",x,y,z);}//娉ㄦ剰鍙檺3浣嶆暟
绛旓細include <stdio.h> void main(){ int i = 0,count = 1,n;printf("璇杈撳叆涓涓1~15浠ュ唴鐨勬鏁存暟:\n");scanf("%d",&i);for(n = 1;n <= i;i--){ count = count * i;} printf("闃朵箻鍊间负%d\n",count);}
绛旓細include<stdio.h> int main(){ int n,i,j,t,l;int sum=0;printf("璇杈撳叆涓涓澶т簬2鐨鏁存暟锛");scanf("%d",&n);l=n;for(;n>=2;n--){ for(i=2;i<n;i++){ if(n%i!=0)//鍒ゆ柇鍏朵负绱犳暟 t=1;else { t=2;break;} } if(t==1){ sum+=n;//printf("%d ",n);//...
绛旓細include <stdio.h> int main(){ int x;scanf("%d",&x);printf("s1=%d\ns2=%d\n",25*x*x,25*x*x+5*x);return 0;}
绛旓細1銆佹柊寤涓涓宸ョ▼鍜.c鏂囦欢 锛岃緭鍏澶存枃浠跺拰涓诲嚱鏁般2銆佸畾涔夊彉閲忕被鍨嬪拰璧嬪垵鍊笺3銆杈撳叆鏁存暟銆4銆佺敤for寰幆璁＄畻鏁存暟鐨勯暱搴︺5銆佺敤for寰幆灏嗗悇浣嶆暟瀛楀瓨鍏ユ暟缁勪腑銆6銆佺敤for寰幆杈撳嚭鏁扮粍銆7銆佺紪璇戯紝杈撳嚭鏈灏忓笺
绛旓細include"stdio.h"void main(){ int a;printf("璇杈撳叆涓涓暣鏁帮細");scanf("%d",&a);for (int i=1;i<=10;i++){ printf("%d",a);printf("*");printf("%d",i);printf("=");printf("%d\t",a*i);if (i%2==0)printf("\n");} } ...
绛旓細%d",&n);printf("Please input %d integers:",n); //绉诲姩鍒板惊鐜for(i=0;i<n;i++) //杩欓噷澶氫簡鍒嗗彿{scanf("%d",&a[i]);sum+=a[i];}average=sum/n; //sum鏄痜loat鎵嶈兘寰楀埌灏忔暟printf("averge=%.2f\n",average); //鍙橀噺鍚峟or(i=n-1;i>=0;i--)printf("%d ",a[i])...
绛旓細n=-n; sprintf(ch,"%ld",n); len=strlen(ch);for(i=0;i<len;i++)sum+=ch[i]-'0';printf("%d鏄涓涓%d浣嶆暟鐨鏁存暟\n",n,len);printf("鍚勪綅鏁扮殑鍜= %d\n",sum); return 0;}绀轰緥杩愯缁撴灉锛12345678 12345678鏄竴涓8浣嶆暟鐨勬暣鏁 鍚勪綅鏁扮殑鍜= 36 ...
绛旓細include <stdio.h> int main(){ int num,s=1;scanf("%d",&num);while(num>0){ s=s*(num%10);num/=10;} printf("姣忎綅鏁颁箣绉槸锛%d\n",s);return 0;}
绛旓細include <stdio.h>int s[1000];void f(int a[],int len,int n){if (!n){for (int i=0;i<len-1;i++){printf("%d ",s[i]);}printf("%d\n",s[len-1]);} for (int i=0;i<len;i++){if (a[i]!=0){s[len-n]=a[i];a[i]=0;f(a,len,n-1);a[i]=i+1;...
