AMBERPWJ的专栏

6. #include int main() { char ch; while ((ch = getchar()) != '\n') { if (ch >= 'a' && ch <= 'z') ch = ch - 32; printf ("%c", ch); } return 0; }

10. #include "stdio.h" int reverse( int s); int main(void) { int a; scanf("%d", &a); printf("%d %d", a, reverse(a)); } int reverse(int s) { int t = 0; while(s > 0) { t *= 10; t += s % 1

1.数字排序：#include int main() { int n,i=0,j=0; int a[5]; printf("请输入要排序的数字:\n",a[5]); for(i=0;i<5;i++) scanf("%d",&a[i]); for(i=1;i<5;i++){ for(j=i;j>=1;j--){ if(a[j-1]>a[j]){ n=a[j-1];

16. #include #include int Fun(int a[], int len); int main() { const int MAX = 100; int a[MAX] = {2,3,7,8,9,10,13,21,24,27}; int len = 10; int s = Fun(a, len); printf("%d\

20.#include void trans(int n,int base) { if(n==0){ return; } trans(n/base,base); if(n%base<10){ printf("%d",n%base); } else{ printf("%c",n%base-10+'A'); } } int main() { int n,ba

15.#include int main() { int a[6] = {-2,-1,0,7,9}; int i,j,x,t; scanf("%d",&x); for(i=0;i<5;i++) if(x<a[i]) break; for(j=5;j>i;j--) a[j]=a[j-1]; a[j]=x;

17. #include int main() { int a[10]; int sum = 0; for (int i = 0; i < 10; i++) { scanf("%d", &a[i]); sum += a[i]; } double average = sum / 10.0; printf("

10.#include "stdio.h" #include "math.h" int main() { float a,b,c,p,s; printf("请输入三角形的三边长："); scanf("%f%f%f",&a,&b,&c); if(a+b>c&&a+c>b&&b+c>a) printf("能构成三角形\n"); else { printf("不能构成三角形 \n");

14.#include int reverse(int s); int main() { int a; scanf("%d", &a); printf("%d %d", a, reverse(a)); } int reverse(int s) { int t = 0; while(s > 0) { t *= 10; t += s % 10; s /= 1