結果

問題 No.1927 AB-CD
ユーザー watarimaycry2watarimaycry2
提出日時 2022-05-06 21:58:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 491 ms / 2,000 ms
コード長 5,511 bytes
コンパイル時間 2,618 ms
コンパイル使用メモリ 81,384 KB
実行使用メモリ 46,968 KB
最終ジャッジ日時 2024-07-05 23:13:00
合計ジャッジ時間 11,612 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,420 KB
testcase_01 AC 51 ms
37,392 KB
testcase_02 AC 52 ms
37,208 KB
testcase_03 AC 51 ms
37,184 KB
testcase_04 AC 404 ms
45,064 KB
testcase_05 AC 391 ms
46,968 KB
testcase_06 AC 381 ms
44,736 KB
testcase_07 AC 375 ms
44,432 KB
testcase_08 AC 89 ms
38,480 KB
testcase_09 AC 388 ms
43,612 KB
testcase_10 AC 321 ms
42,048 KB
testcase_11 AC 375 ms
44,580 KB
testcase_12 AC 190 ms
40,232 KB
testcase_13 AC 218 ms
40,584 KB
testcase_14 AC 76 ms
38,224 KB
testcase_15 AC 123 ms
38,804 KB
testcase_16 AC 380 ms
44,672 KB
testcase_17 AC 293 ms
41,636 KB
testcase_18 AC 314 ms
42,084 KB
testcase_19 AC 350 ms
43,936 KB
testcase_20 AC 436 ms
45,580 KB
testcase_21 AC 358 ms
44,504 KB
testcase_22 AC 170 ms
39,664 KB
testcase_23 AC 455 ms
46,248 KB
testcase_24 AC 491 ms
45,352 KB
testcase_25 AC 491 ms
45,468 KB
testcase_26 AC 483 ms
45,480 KB
testcase_27 AC 52 ms
37,356 KB
testcase_28 AC 52 ms
36,940 KB
testcase_29 AC 52 ms
37,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int N = nextInt();
		String S = next();
		int mod = 998244353;
		Combination comb = new Combination(N + 1, mod);
		int c = 0;
		for(int i = 0; i < N; i++){
			if(S.charAt(i) == 'A' || S.charAt(i) == 'B'){
				c++;
			}
		}
		myout(comb.nCk(N, c));
	}
	//メソッド追加エリア　ここから

static long mypow(long x, long n, long m) {
    long ans = 1;
    while (n > 0) {
        if ((n & 1) == 1){
            ans *= x;
            if(m != -1){
                ans %= m;
            }
        }
	if(m != -1){
            x %= m;
        }
        x *= x;
        if(m != -1){
            x %= m;
        }
        n >>= 1;
    }
    return ans;
}

//組み合わせ
static class Combination{
    long[] kaijo;
    long[] inverse;
    long mod;
    int size;
    Combination(int N, long mod){
        this.mod = mod;
        this.size = N;
        kaijo = new long[N + 1];
        inverse = new long[N + 1];
        kaijo[0] = 1;
        inverse[0] = 1;
        for(int i = 1; i <= N; i++){
            kaijo[i] = kaijo[i - 1] * (long)i % mod;
            inverse[i] = inverse[i - 1] * mypow((long)i, mod - 2, mod) % mod;
        }
    }
    public long nCk(int n, int k){
        if(k < 0 || k > n){
            return 0;
        }
        return ((kaijo[n] * inverse[k]) % mod * inverse[n - k]) % mod;
    }
    public long nPk(int n, int k){
        if(k < 0 || k > n){
            return 0;
        }
        return (kaijo[n] * inverse[n - k]) % mod;
    }
    public long nHk(int n, int k){
        if(n + k - 1 < 0 || k < 0 || n < 0 || k > size || n > size || (n + k - 1) > size){
            return 0;
        }
        return nCk(n + k - 1, k);
    }
}

	//メソッド追加エリア　ここまで
}
0