1 条题解

  • 0
    @ 2025-4-7 21:28:47

    C :

    #include<stdio.h>
    #include<string.h>
    int main()
    {
    	char a[102],b[102];
    	int i,k,l1,l2,l;
    	gets(a);
    	gets(b);
    	l1=strlen(a);
    	l2=strlen(b);
    	l=l1<l2?l1:l2;
    	for(k=0,i=0;i<l;i++)
    	{
    		if(a[i]<b[i]){printf("-%d\n",b[i]-a[i]);k++;break;}
    		if(a[i]>b[i]){printf("%d\n",a[i]-b[i]);k++;break;}
    	}
    	if(k==0)
    		printf("0\n");
    	return 0;
    }
    

    C++ :

    #include <stdio.h>
    #include <string.h>
    int main() {
    	char str[2][101];
    	int i, retVal = 0;
    	for (i = 0;i < 2;i++)
    		gets(str[i]);
    	for (i = 0;str[0][i] != '\0' && str[1][i] != '\0';i++)
    		if (str[0][i] != str[1][i])
    			break;
    	retVal = str[0][i] - str[1][i];
    	printf("%d\n", retVal);
    	return 0;
    }
    
    

    Pascal :

    var 
      i,j,la,lb:longint;
      sa,sb:string;
      
    begin
      readln(sa);
      readln(sb);
      la:=length(sa);
      lb:=length(sb);
      if(la>lb) then la:=lb; //取小
      j:=0;
      for i:=1 to la do begin
        if(sa[i]=sb[i]) then continue;
        j:=ord(sa[i])-ord(sb[i]);
        break;
      end;
      writeln(j);
    end.
    
    
    
    

    Java :

    
    
    import java.util.Scanner;
    
    public class Main {
       private static Scanner s = new Scanner(System.in) ;
       
       public static void main(String[] args) {
    	  String str1 = s.nextLine() ;
    	  String str2  =s.nextLine() ;
    	  if(str1.equals(str2)){
    		  System.out.println(0) ;
    	  }else {
    	  char c1[] = str1.toCharArray() ;
    	  char c2[] = str2.toCharArray() ;
    	  int sum = 0 ;
    	  if(str1.compareTo(str2)<0){
    	  for (int i = 0; i < c2.length; i++) {
    	     if(c1[i]!=c2[i]){
    	    	 sum = c1[i]-c2[i] ;
    	    	 break ;
    	     }
    	  }
    	  }else {
    		  for (int i = 0; i < c1.length; i++) {
    			     if(c1[i]!=c2[i]){
    			    	 sum = c1[i]-c2[i] ;
    			    	 break ;
    			     }
    	  }
    	  }
    	  System.out.println(sum);
    	  }
    	  
    	  
    }}
    
    
    • 1

    信息

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