一:
#include<stdio.h>
#include<ctype.h>
#include<string.h>
int main(){
int a=0;
char c[100]={0};
char d[100]={0};
scanf("%s",c);
scanf("%s",d);
if(strlen(c)!=strlen(d)){
a=1;
}
else {
if(strcmp(c,d)==0)a=2;
else{
int len1=strlen(c);
int len2=strlen(d);
for(int i=0;i<len1;i++)if(islower(c[i]))c[i]=toupper(c[i]);
for(int i=0;i<len2;i++)if(islower(d[i]))d[i]=toupper(d[i]);
if(strcmp(c,d)==0)a=3;
else a=4;
}
}
printf("%d",a);
}
二:
#include<stdlib.h>
#include<stdio.h>
int compare(const void* a, const void* b) { return *(int*)b - *(int*)a; }
void print(int* a, int len) {
qsort(a, len, 4, compare);//排序
for (int i = 0; i < len - 1; i++) { printf("%d, ", a[i]); }//打印结果
printf("%d\n", a[len - 1]);
return;
}//void sort(int* a, int len) {
for (int i = 0; i < len - 1; i++)//趟数{
int flag = 1;
for (int j = 0; j < len-1-i; j++)//已经确定了i个元素后,每趟需要排序的最多次数减少{
if (a[j] < a[j + 1]){
int tem = a[j];
a[j] = a[j + 1];
a[j + 1] = tem;
flag = 0;
}
}
if (flag ==1)break;
}
for(int i=0;i<len-1;i++)printf("%d, ",a[i]);//打印结果
printf("%d\n",a[len-1]);//打印结果
return;
}
void prin(int* a, int len) {
for (int i = 0; i < len; i++) {
if (a[i] <= 26 && a[i] >= 1) { a[i] = a[i] + 64; printf("%c", a[i]); }
else printf("*");}
return;
}
int min(int* a, int len) {
int i = 0;
int mi = a[0];
for (int i = 0; i < len; i++) { if (a[i] < mi)mi = a[i]; }
return mi;
}
int main()
{int a[1000] = { 0 };
int i = 0;
while (scanf("%d, ", &a[i]) != EOF)i++;
printf("%d\n", i);//任务一
printf("%d\n", min(a, i));//任务二
int b[1000] = { 0 };
memmove(b, a, 4000);//复制a数组,防止qsort排序a数组后,数组本身被改变影响到任务四;
print(a, i);//任务3//或者使用冒泡排序完成任务三:sort(a, i);
prin(b, i);///任务四return 0;
}