1 条题解

  • 0
    @ 2025-4-7 21:19:27

    C :

    #include<stdio.h>
    #include<string.h>
    int main()
    {
      char str[3][20],*p[3],*ptr;
      int i,j;
      for(i=0;i<3;i++)
            p[i]=str[i];
      for(i=0;i<3;i++)
        scanf("%s",str[i]);
      for(i=0;i<2;i++)
        for(j=i+1;j<3;j++)
        if(strcmp(p[i],p[j])>0)
      {
          ptr=p[i];
          p[i]=p[j];
          p[j]=ptr;
      }
      for(i=0;i<3;i++)
        printf("%s\n",p[i]);
      return 0;
    }
    
    
    

    C++ :

    #include <stdio.h>
    #include <string.h>
    int main() {
    	char *pa, *pb, *pc, *t;
    	char a[21], b[21], c[21], ch;
    	int i;
    	/* 分别读入三个字符串 */
    	i = 0;
    	while ((ch = getchar()) != '\n') {
    		a[i] = ch;
    		i++;
    	}
    	a[i] = '\0';
    	i = 0;
    	while ((ch = getchar()) != '\n') {
    		b[i] = ch;
    		i++;
    	}
    	b[i] = '\0';
    	i = 0;
    	while ((ch = getchar()) != '\n') {
    		c[i] = ch;
    		i++;
    	}
    	c[i] = '\0';
    	/* 三对字符串的比较和调换过程 */
    	pa = a; pb = b; pc = c;
    	if (strcmp(pa, pb) > 0) {
    		t = pa; pa = pb; pb = t;
    	}
    	if (strcmp(pa, pc) > 0) {
    		t = pa; pa = pc; pc = t;
    	}
    	if (strcmp(pb, pc) > 0) {
    		t = pb; pb = pc; pc = t;
    	}
    	printf("%s\n", pa);
    	printf("%s\n", pb);
    	printf("%s\n", pc);
    	return 0;
    }
    
    

    Pascal :

    var
      a:array[1..20] of string;
      i,j,n:longint;
      t:string;
    begin
      n:=3;
      for i:=1 to n do readln(a[i]);
      for i:=1 to n-1 do
        for j:=i+1 to n do
        if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
      for i:=1 to n do writeln(a[i]);
    end.
    
    

    Java :

    
    
    import java.util.Arrays;
    import java.util.Scanner;
    
    public class Main{
       private static Scanner s = new Scanner(System.in) ;
       
       public static void main(String[] args) {
    	  String strs[] = new String[3] ;
    	  
    	  for (int i = 0; i < strs.length; i++) {
    		  strs[i] = s.next() ;
    	  }
    	  
    	  Arrays.sort(strs);
    	  
    	  for (int i = 0; i < strs.length; i++) {
    		 System.out.println(strs[i]) ;
    	  }
       }
    }
    
    
    • 1

    信息

    ID
    1082
    时间
    1000ms
    内存
    32MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者