結果
問題 |
No.3110 Like CPCTF?
|
ユーザー |
![]() |
提出日時 | 2025-04-21 16:29:28 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 3,811 bytes |
コンパイル時間 | 2,384 ms |
コンパイル使用メモリ | 80,716 KB |
実行使用メモリ | 50,916 KB |
最終ジャッジ日時 | 2025-04-21 16:29:32 |
合計ジャッジ時間 | 4,307 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(); int n = sc.nextInt(); char[] inputs = sc.next().toCharArray(); int ans = 0; for (int a = 0; a < n; a++) { for (int b = a + 1; b < n; b++) { if (inputs[a] == inputs[b]) { continue; } for (int c = b + 1; c < n; c++) { if (inputs[a] != inputs[c]) { continue; } for (int d = c + 1; d < n; d++) { if (inputs[a] == inputs[d] || inputs[b] == inputs[d]) { continue; } for (int e = d + 1; e < n; e++) { if (inputs[a] == inputs[e] || inputs[b] == inputs[e] || inputs[d] == inputs[e]) { continue; } ans++; } } } } } System.out.println(ans); } } class FastScanner { private DataInputStream din; private byte[] buffer; private int bufferPointer, bytesRead; private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト public FastScanner() { din = new DataInputStream(System.in); buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; } private byte read() { try { if (bufferPointer == bytesRead) { bytesRead = din.read(buffer, 0, BUFFER_SIZE); if (bytesRead == -1) return -1; bufferPointer = 0; } return buffer[bufferPointer++]; } catch (IOException e) { throw new RuntimeException(e); } } public String next() { byte b = read(); // 空白文字を読み飛ばす while (isSpaceChar(b)) { b = read(); } StringBuilder sb = new StringBuilder(); while (!isSpaceChar(b)) { sb.append((char) b); b = read(); } return sb.toString(); } public int nextInt() { int ret = 0; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10 + c - '0'; c = read(); } while (!isSpaceChar(c)); return neg ? -ret : ret; } public long nextLong() { long ret = 0; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10L + c - '0'; c = read(); } while (!isSpaceChar(c)); return neg ? -ret : ret; } public double nextDouble() { double ret = 0, div = 1; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10 + c - '0'; c = read(); } while (!isSpaceChar(c) && c != '.'); if (c == '.') { while (!isSpaceChar(c = read())) { ret += (c - '0') / (div *= 10); } } return neg ? -ret : ret; } private boolean isSpaceChar(byte c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public void close() { try { if (din != null) din.close(); } catch (IOException e) { throw new RuntimeException(e); } } }