用C语言编写一个函数将任意一个三位数n逆序输出,即若n等于369,则输出963。
0到10是11个数了,所以不要等于!要倒序输出可以用递归算法!很好用
,任你字符串多长,只要不爆炸就可以
给你一个,先输入完字串,再倒序输出的:
#include
void
fun()
{
char
c;
if((c=getchar())!='\n')
fun();
putchar(c);
}
main()
{
fun();
getchar();
}
按确认键输出
绛旓細=1 || x<1){printf("Input error, exit...\n");return 0;}intrev(x);printf("\n");return 0;}杩愯鏍蜂緥锛
绛旓細鍦C璇█涓紝鍙互缂栧啓涓涓嚱鏁flower()鏉ュ垽鏂竴涓暣鏁版槸鍚︿负鈥滄按浠欒姳鏁扳濄備互涓嬫槸涓绉嶅彲鑳界殑瑙f硶锛♡♡ 鏈夊府鍔╁埌鐨勮瘽锛岄夯鐑﹂噰绾冲摝锛♡♡
绛旓細include <stdio.h> define ROW 3 define COL 2 int main(){ int a[ROW][COL];int i,j,maxi,maxj,mini,minj,max,min;printf("璇疯緭鍏ユ暟缁刟锛");for(i=0;i<ROW;i++)for(j=0;j<COL;j++)scanf("%d",&a[i][j]);max=min=a[0][0];maxi=maxj=mini=minj=0;for(i=0;i<RO...
绛旓細printf("璇疯緭鍏涓涓娴偣鏁帮細");scanf("%f",&x);printf("鍥涜垗浜斿叆鐨勭粨鏋滄槸锛%d",round1(x));return 0;}
绛旓細include<stdio.h> define N 3 int main(){ int a[N][N];int b[N][N];int i,j;printf("璇疯緭鍏ョ煩闃:\n");for(i=0;i<N;i++)for(j=0;j<N;j++){ scanf("%d",&a[i][j]);//杈撳叆鐭╅樀 b[j][i]=a[i][j];//杞疆鐭╅樀 } printf("杞疆鍚庣煩闃典负:\n");//杈撳嚭鐭╅樀 for...
绛旓細鏂规硶涓銆乮nclude<stdio.h> void main(){ void switchArray(int[3][3]);int array[][3]={{1,2,3},{4,5,6},{7,8,9}};int i,j;switchArray(array);return 0;} void switchArray(int array[][3]){ int newArray[3][3];int i,j;for(i=0;i<3;i++){ for(j=0;j<3;j...
绛旓細include "stdio.h"long JieCheng(int a) //瀹氫箟闃朵箻鍑芥暟 { int i;long s=1;for(i=a;i>1;i--)s*=i;return s;} void main(){ int n;printf("璇疯緭鍏:\n");scanf("%d",&n);printf("n锛=%ld\n",JieCheng(n));}
绛旓細鍏堝啓鍑涓涓濡備笅鐨鍑芥暟锛歩nt fun(int n){ int s=1;for(int i=1;i<=n;i++)s*=i;return s;} 鐒跺悗鍦ㄤ富鍑芥暟涓皟鐢ㄥ弽澶嶈皟鐢ㄥ畠 int main(){ int n;while(cin>>n){ int sum=0;for(int i=1;i<=n;i++){ sum+=fun(i);} cout<<sum<<endl;} } ...
绛旓細include <string.h> void *memcpy( void *to, const void *from, size_t count );鍔熻兘锛鍑芥暟浠巉rom涓鍒禼ount 涓瓧绗﹀埌to涓紝骞惰繑鍥瀟o鎸囬拡銆 濡傛灉to 鍜 from 閲嶅彔锛屽垯鍑芥暟琛屼负涓嶇‘瀹氥俶emmove 璇硶:include <string.h> void *memmove( void *to, const void *from, size_t count );鍔熻兘:...
绛旓細sumAll(int x){ int ret=0; while(x){ ret+=x%10; x/=10; } return ret;}int main(){ int d; printf("璇疯緭鍏ラ渶瑕佽绠楃殑鏁存暟锛"); scanf("%d",&d); printf("鍚勪綅涔嬪拰鏄 %d\n",sumAll(d)); return 0;} ...