結果

問題 No.927 Second Permutation
ユーザー clocklrclocklr
提出日時 2020-03-12 16:27:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 3,470 bytes
コンパイル時間 1,132 ms
コンパイル使用メモリ 114,888 KB
実行使用メモリ 25,804 KB
最終ジャッジ日時 2024-11-18 13:06:38
合計ジャッジ時間 2,927 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
21,428 KB
testcase_01 AC 23 ms
23,528 KB
testcase_02 AC 23 ms
23,524 KB
testcase_03 AC 23 ms
23,416 KB
testcase_04 AC 22 ms
23,600 KB
testcase_05 AC 22 ms
23,676 KB
testcase_06 AC 21 ms
23,648 KB
testcase_07 AC 21 ms
23,472 KB
testcase_08 AC 26 ms
23,616 KB
testcase_09 AC 22 ms
25,732 KB
testcase_10 AC 28 ms
23,768 KB
testcase_11 AC 35 ms
23,648 KB
testcase_12 AC 28 ms
25,556 KB
testcase_13 AC 23 ms
23,616 KB
testcase_14 AC 29 ms
21,708 KB
testcase_15 AC 30 ms
23,376 KB
testcase_16 AC 37 ms
23,524 KB
testcase_17 AC 37 ms
23,648 KB
testcase_18 AC 36 ms
23,628 KB
testcase_19 AC 37 ms
23,628 KB
testcase_20 AC 37 ms
25,804 KB
testcase_21 AC 35 ms
21,712 KB
testcase_22 AC 37 ms
23,776 KB
testcase_23 AC 36 ms
21,704 KB
testcase_24 AC 33 ms
23,476 KB
testcase_25 AC 30 ms
23,480 KB
testcase_26 AC 26 ms
23,616 KB
testcase_27 AC 26 ms
21,680 KB
testcase_28 AC 32 ms
23,484 KB
testcase_29 AC 30 ms
23,360 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;

public class Hello{
    static public long mod = 1000000007;
    public static void Main(){
        char[] cha = rstr().ToCharArray();
        Array.Sort(cha);
        Array.Reverse(cha);
        int leng = cha.Length;
        string ans = "";
        for(int i=leng-1;i>0;i--){
            if(i == 1 && (cha[i] == '0' || cha[i] == cha[i-1])){
                ans = "-1";
                break;
            }else if(cha[i] != cha[i-1]){
                char temp = cha[i];
                cha[i] = cha[i-1];
                cha[i-1] = temp;
                ans = new string(cha);
                break;
            }
        }
        WriteLine(ans);


        

        
        
        
    

        
        
        
        
    }
    // ncr mod
    //static int ncr(int n,int r){r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    //static long square2(long a,long b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return value;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long divideup(long divided,long divid){ long temp_divide = divided/divid; if(divided % divid > 0){ temp_divide++; } return temp_divide; }
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
}
0