有没有C语言大神啊，帮写个程序呗。输入一个五位数的正整数，按顺序输出组成该整数的各位数字！！！！ C语言 从键盘上输入一个正整数,计算并输出该数的各位数字之和
\u7f16\u5199\u7a0b\u5e8f:\u8f93\u5165\u4e00\u4e2a\u4e0d\u591a\u4e8e\u4e94\u4f4d\u6570\u7684\u6b63\u6574\u6570\uff0c\u8981\u6c42:\u8f93\u51fa\u5b83\u7684\u4f4d\u6570;\u987a\u5e8f\u8f93\u51fa\u5b83\u7684\u6bcf\u4e00\u4f4d\u6570;\u9006\u5e8f\u8f93\u51fa\u5b83\u7684\u4f4d\u6570
#includeint main(){ int x,i,j,a[12]; printf("\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570:\n"); scanf("%d",&x); for(i=0;x;x/=10)a[i++]=x%10; printf("\u5b83\u662f%d\u4f4d\u6570\n",i); for(j=i-1;j>=0;j--)printf("%d ",a[j]); printf("\n"); for(j=0;j<i;j++)printf("%d ",a[j]); printf("\n"); return 0;}
\u8f93\u51fa\u8be5\u6570\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u7684\u6e90\u4ee3\u7801\u5982\u4e0b\uff1a
#include
int fun(int n)
{
int i;
int sum=0;
if(n>1000||n<0)
{
puts("\u8f93\u5165\u7684\u6570\u5b57\u8d85\u51fa\u8303\u56f4\uff01"); // \u9519\u8bef\u4fe1\u606f\u63d0\u793a
}
else
{
for(i=2;i<n;i++) // \u5faa\u73af\u904d\u5386n\uff0c\u53d6\u51fa\u56e0\u5b50\uff0c\u5e76\u8fdb\u884c\u7d2f\u52a0
{
if(0 == n%i)
{
sum+=i;
}
}
}
return sum;
}
void main()
{
int n,sum;
printf("Input n: ");
scanf("%d",&n);
sum=fun(n);
printf("sum=%d\n",sum);
}
\u6269\u5c55\u8d44\u6599
1\u3001\u8f93\u5165\u7684\u6570\u5b57\u8981\u662f\u6574\u6570\uff0c\u5e76\u4e14\u8981\u5728\u89c4\u5b9a\u8303\u56f4\u5185\u3002
2\u3001\u5bf9\u8f93\u5165\u7684\u6570\u8981\u8fdb\u884c\u62c6\u5206\uff0c\u6ce8\u610f1\u548c\u672c\u8eab\u4e0d\u80fd\u5728\u6c42\u548c\u4e4b\u4e2d\u3002
3\u3001\u53ef\u4ee5\u4f7f\u7528\u5faa\u73af\u5bf9\u8f93\u5165\u7684\u6570\uff08n\uff09\u904d\u5386\uff0c\u5982\u679cn%i\u4f59\u4e3a0\uff0c\u5219\u8868\u660e\u80fd\u6574\u9664\uff0c\u6b21i\u5219\u4e3a\u56e0\u5b50\u3002
1.从个位开始输出
#include <stdio.h>
int main(int argc, char *argv[])
{ int a,n;
printf("输入一个五位数正整数:");
scanf("%d",&a);
while(a>0)
{n=a%10;
printf("%d\n",n);
a=a/10;
}
return 0;
}
2.从最高（万）位开始输出
#include <stdio.h>
int main(int argc, char *argv[])
{ int a,n,b[30],i=0,j;
printf("输入一个五位数正整数:");
scanf("%d",&a);
while(a>0)
{n=a%10;
b[i]=n;
a=a/10;
i++;
}
for(j=4;j>=0;j--)
printf("%d ",b[j]);
return 0;
}
3.逆序输出
#include"stdio.h"
#include "math.h"
main()
{
int i,n,m,s=0;
printf("输入一个五位整数:" );
scanf("%d",&i);
for (n=5;n>1;n--)
{
s+=i%10 ;
for (m=5;m>1;m--)
{s*=10;
break;
}
i=i/10;
}
s=s+i;
printf("逆序输出%d\n",s);
return 0;
}
随便码了一个最简单的，有需求再追问#includeint main(){ int dat[5]; printf("Please Enter 5 Data\n"); scanf("%d,%d,%d,%d,%d",&dat[0],&dat[1],&dat[2],&dat[3],&dat[4]); printf("%d,%d,%d,%d,%d",dat[4],dat[3],dat[2],dat[1],dat[0]); getch(); return 0;}希望能帮助你。
#include <stdio.h>
int main()
{
int n=0;
int i = 0;
char aczStr[6];
memset(aczStr , 0x00 , sizeof(aczStr) );
printf("input n:");
scanf("%d" ,&n );
sprintf(aczStr , "%d" , n);
while ( 4 >= i )
{
printf("%c\n" , aczStr[i] );
i++;
}
return 0;
}
#include<stdio.h>
#include<math.h>
#define N 5
int main()
{
int i=N-1,n,a[N]={0};
scanf("%d",&n);
while(n>0)
{
a[i]=n%10;
n/=10;
i--;
}
for(i=0;i<N;i++)
printf("%3d",a[i]);
return 0;
}
#include <stdio.h>
int main()
{
int n=0;
int i=10000;
printf("input n:");
scanf("%d" ,&n );
while ( i )
{
printf("%d\n" , n/i%10) ;
i /= 10 ;
}
return 0;
}
绛旓細杈撳叆4涓暣鏁(閫楀彿闅斿紑) : 23 45 80 9 鎺掑簭鍚 :80 45 23 9 璇锋寜浠绘剰閿户缁. . ./ include <stdio.h> const int N = 4;void SelectSort(int a[], int n) { int i,j,k,t;for(i = 0; i < n - 1; ++i) { k = i;for(j = i + 1; j < n; ++j) { if(a[j]...
绛旓細1.浠庝釜浣嶅紑濮嬭緭鍑 include <stdio.h> int main(int argc, char *argv[]){ int a,n;printf("杈撳叆涓涓簲浣嶆暟姝ｆ暣鏁:");scanf("%d",&a);while(a>0){n=a%10;printf("%d\n",n);a=a/10;} return 0;} 2.浠庢渶楂橈紙涓囷級浣嶅紑濮嬭緭鍑 include <stdio.h> int main(int argc, char ...
绛旓細1銆佸疄鐜版枃浠跺啓鍏ュ姛鑳斤紝涓娆″啓鍏ヤ竴涓亴宸ヤ俊鎭2銆佸疄鐜版煡璇㈠姛鑳(鍖呭惈4绉嶆潯浠舵煡璇)銆3銆佸疄鐜颁俊鎭垹闄ゅ拰淇敼骞跺啓鍏ユ枃浠躲傛牴鎹鎰忥紝鏁版嵁鐢ㄧ粨鏋勬暟缁勫瓨鍌紝涓旇亴宸ョ紪鍙峰敮涓鎬э紝鍥犳鍗曠嫭涓や釜鍑芥暟璁＄畻淇℃伅闀垮害鍜岀紪鍙枫傞櫎鏉′欢鏌ヨ鍑芥暟鍜岃鍙栨枃浠剁殑鍑芥暟锛屼笉浼氳嚜琛宖ree閲婃斁鍐呭瓨銆傚浣犲啓浠ｇ爜璋冪敤锛屾敞鎰忚嚜琛屽啓free璇彞閲婃斁銆
绛旓細include <stdio.h> int main (void){ int a[101]={0},i,j,k;for(k=1;k<=100;k++)for ( i=k,j=k; i<=100; i+=j)a[i]=1-a[i];printf("寮鐫鐨勯棬锛歕n");for(i=1;i<=100;i++)if(a[i]==1)printf("%4d",i);printf ("\n");printf("姣忎竴鎵囬棬鐨勭姸鎬侊細\n");...
绛旓細void rotate( int (*arrA)[MAX], int (*arrB)[MAX], int m, int n);int main(void){ int arrA[MAX][MAX], arrB[MAX][MAX], i, j, m, n;printf("璇疯緭鍏 m n: ");scanf("%d %d", &m, &n);printf("璇疯緭鍏 %d 琛 %d 鍒楃煩闃:\n", m, n);for (i=0; i<m; i...
绛旓細printf("娌℃湁姝や綔鑰呫俓n"); }} else if (c!=1 && c!=2 && c!=3) { printf("杈撳叆鏈夎,璇烽噸鏂拌緭鍏!\n"); searchBook(&book); } }}void addInformation(BOOK (*p)[500])//澧炲姞涔︾睄淇℃伅{ int i=0; while ((*p+i)->idNum>=1000 && (*p+i)->idNum<=2000) // 纭畾鏁版嵁瀛樻斁涓嬫爣,鏈鍚...
绛旓細Elem_Type *array,int len){ for(int i=0; i<len; i++) if(array[i] == num) return i; //return -1;//娌℃湁鎵惧埌} //鍓嶅簭閬嶅巻 涓簭閬嶅巻 涓簭鏁扮粍闀垮害BiTree *Resume_BiTree(Elem_Type *front,Elem_Type *center,int len){ if(len <= 0) return...
绛旓細缁欎綘鍐欎釜鎶,涓嬮潰鏄绋嬪簭浠ｇ爜 include <stdio.h> int main(){ int ch;int num=0,count=0,other=0;printf("Input a string:\n");while((ch=getchar())!='\\'){ if(ch<='9'&&ch>='0')num++;else if(ch=='+'||ch=='-'||ch=='*'||ch=='/'||ch=='%'||ch=='=')...
绛旓細break锛沜ase3锛歱rintf锛堬紓锛卍锛婏紖d锛濓紖d锛糿锛傦紝i锛宩锛宯um锛漣锛妀锛夛紱锛忥紡瀹炵幇涔樻硶鍔熻兘 break锛沜ase4锛歱rintf锛堬紓锛卍锛嶏紖d锛濓紖d锛糿锛傦紝i锛宩锛宯um锛漣锛廽锛夛紱锛忥紡瀹炵幇闄ゆ硶鍔熻兘 break锛沝efault锛歱rintf锛堬紓杈撳叆鏈夎閲嶆柊閫夋嫨锛傦級锛沚reak锛涳綕 锝漺hile锛坰elect锛夛紱return0锛涳綕 杩愯缁撴灉锛...
绛旓細绋嬪簭1銆戦鐩細鏈1銆2銆3銆4涓暟瀛楋紝鑳界粍鎴愬灏戜釜浜掍笉鐩稿悓涓旀棤閲嶅鏁板瓧鐨勪笁浣嶆暟锛熼兘鏄灏戯紵1.绋嬪簭鍒嗘瀽锛氬彲濉湪鐧句綅銆佸崄浣嶃佷釜浣嶇殑鏁板瓧閮芥槸1銆2銆3銆4銆傜粍鎴愭墍鏈夌殑鎺掑垪鍚庡啀鍘 鎺変笉婊¤冻鏉′欢鐨勬帓鍒椼俰nclude 鈥渟tdio.h鈥漣nclude 鈥渃onio.h鈥漨ain(){ int i,j,k;printf(鈥淺n鈥);for(i=1;i...
