# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
293433 | 2020-09-08T05:13:41 Z | updown1 | Mate (COCI18_mate) | Java 11 | 0 ms | 0 KB |
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bf = new BufferedReader(new InputStreamReader(System.in)); PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out)); String str = bf.readLine(); char[] array = new char[str.length()]; int N = array.length; for(int i = 0; i < str.length(); i++)array[i] = str.charAt(i); int[] s = new int[N]; for(int i = 0; i < N; i++)s[i] = array[i]-96; int[][][][] dp = new int[N+1][N+1][27][27]; for(int i = 0; i < N; i++){ /*for(int c = i; c >= 0; c--){ int num = array[c]-96; //dp[i][1][num][0] = 1; dp[i][1][0][num] = 1; }*/ dp[i][1][0][s[i]] = 1; } for(int x = 1; x < N; x++){ for(int length = 1; length <= N; length++){ for(int i = 0; i <= 26; i++){ for(int c = 0; c <= 26; c++){ if(c == s[x]){ for(int d = 0; d < 26; d++){ dp[x][length][i][c] += dp[x-1][length-1][d][i]; } } //else{ dp[x][length][i][c] += dp[x-1][length][i][c]; //} /*if (dp[x][length][i][c] != 0) { System.out.println(x + " " + length + " " + i + " " + c + ": " + dp[x][length][i][c]); if(c == s[x-1]){ System.out.println("match " + c); } }*/ } } } } int Q = Integer.parseInt(bf.readLine()); for(int i = 0; i < Q; i++){ StringTokenizer stk = new StringTokenizer(bf.readLine()); int num = Integer.parseInt(stk.nextToken()); String[] XY = stk.nextToken().split(""); int letter1 = XY[0].charAt(0)-96; int letter2 = XY[1].charAt(0)-96; pw.println(dp[N-1][num][letter1][letter2]); } pw.close(); } }