1 条题解

  • 0
    @ 2025-10-10 15:45:26

    C :

    #include<stdio.h>   
    
    int main(){ 
    	int x;
    	scanf("%d",&x);
    	
    	int a = x / 100;
    	int b = x / 10 % 10;
    	int c = x % 10;
    	
    	
    	if(a < b){
    		int t = a;
    		a = b;
    		b = t;
    	}
    	
    	if(b < c){
    		int t = b;
    		b = c;
    		c = t;
    	}
    	
    	if(a < b){
    		int t = a;
    		a = b;
    		b = t;
    	}
    	
    	printf("%d",a * 100 + b * 10 + c);
    
    	return 0;
    } 
    

    C++ :

    #include<iostream>
    using namespace std;
    int main(){
    	int a,b,c,n,t,x;
    	cin>>n;
    	a=n/100;
    	b=n/10%10;
    	c=n%10;
    	//cout<<a<<" "<<b<<" "<<c<<endl;
    	
    	if(a>b){
    		t=a;
    		a=b;
    		b=t;
    		
    	}
    	if(b>c){
    		t=b;
    		b=c;
    		c=t;
    	}
    	if(a>b){
    		t=a;
    		a=b;
    		b=t;
    	}
    	x=c*100+b*10+a*1;
    	cout<<x<<endl;
    }
    

    Pascal :

    var n,c,b,a,s,t:longint;
    begin
      read(n);
      c:=n mod 10;
      b:=n div 10 mod 10;
      a:=n div 100;
      if a<b then begin t:=a;a:=b;b:=t; end;
      if b<c then begin t:=b;b:=c;c:=t; end;
      if a<b then begin t:=a;a:=b;b:=t; end;
      s:=a*100+b*10+c;
      writeln(s);
    end.
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    
    	public static void main(String[] args) {
    		@SuppressWarnings("resource")
    		Scanner scanner=new Scanner(System.in);
    		int m=scanner.nextInt();
    		int a=m%1000/100;
    		int b=m%100/10;
    		int c=m%10;
    		int x=0;
    		int h;
    		if (a>b) {
    			x=a;
    			a=b;
    			b=x;
    		}
    		if (a>c) {
    			x=a;
    			a=c;
    			c=x;
    		}
    		if (b>c) {
    			x=b;
    			b=c;
    			c=x;
    		}
    		h=c*100+b*10+a;
    		System.out.println(h);	
    		
    		}
    }
    

    Python :

    a = int(input());
    b = a // 100;
    s = a // 10 % 10;
    g = a % 10;
    if b < s :
        t = b;
        b = s;
        s = t;
    
    if b < g :
        t = b;
        b = g;
        g = t;
    
    if s < g :
        t = s;
        s = g;
        g = t;
    
    print(b * 100 + s * 10 + g);
    
    
    
    • 1

    【入门】求任意三位数打乱次序后的最大值

    信息

    ID
    41
    时间
    1000ms
    内存
    512MiB
    难度
    10
    标签
    递交数
    1
    已通过
    1
    上传者