結果

問題 No.170 スワップ文字列(Easy)
ユーザー 37zigen37zigen
提出日時 2020-02-17 18:16:56
言語 Java11
(openjdk 11.0.7)
結果
AC  
実行時間 82 ms / 5,000 ms
コード長 2,866 Byte
コンパイル時間 2,186 ms
使用メモリ 20,888 KB
最終ジャッジ日時 2020-07-09 11:56:02

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 74 ms
20,864 KB
testcase_01 AC 73 ms
20,876 KB
testcase_02 AC 73 ms
20,880 KB
testcase_03 AC 73 ms
20,864 KB
testcase_04 AC 73 ms
20,872 KB
testcase_05 AC 73 ms
20,876 KB
testcase_06 AC 73 ms
20,876 KB
testcase_07 AC 73 ms
20,880 KB
testcase_08 AC 82 ms
20,864 KB
testcase_09 AC 78 ms
20,872 KB
testcase_10 AC 74 ms
20,888 KB
testcase_11 AC 73 ms
20,880 KB
testcase_12 AC 74 ms
20,872 KB
testcase_13 AC 77 ms
20,772 KB
testcase_14 AC 73 ms
20,876 KB
testcase_15 AC 73 ms
20,880 KB
testcase_16 AC 77 ms
20,772 KB
testcase_17 AC 74 ms
20,880 KB
testcase_18 AC 77 ms
20,764 KB
testcase_19 AC 74 ms
20,872 KB
testcase_20 AC 73 ms
20,876 KB
testcase_21 AC 76 ms
20,884 KB
testcase_22 AC 73 ms
20,880 KB
testcase_23 AC 72 ms
20,876 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

class Main {
	public static void main(String[] args) throws Exception {
		new Main().run();
	}
	
	long pow(long a,long n) {
		long r=1;
		for(;n>0;n>>=1,a=a*a)if(n%2==1)r*=a;
		return r;
	}
	
	long fac(long n) {
		long r=1;
		for(int i=1;i<=n;++i)r*=i;
		return r;
	}

	void run() {
		Scanner sc=new Scanner();
		char[] cs=sc.next().toCharArray();
		long ans=1;
		for(int i=2;i<=cs.length;++i) {
			ans*=i;
		}
		int[] c=new int[26];
		for(int i=0;i<cs.length;++i)c[(int)(cs[i]-'A')]++;
		for(int i=0;i<c.length;++i)ans/=fac(c[i]);
		System.out.println(ans-1);
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}

class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
0