解题思路:
递归解法:找到S(n) 和 S(n-1) 的关系,即可快速做出。
注意事项:
参考代码:
import java.util.Scanner; public class C1463 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int n = sc.nextInt(); StringBuffer sb = S(n, n); System.out.println(sb); } sc.close(); } private static StringBuffer S(int n, int m){ StringBuffer sb = new StringBuffer(); if(n == 1) sb.append(An(1)).append("+" + (m)); else sb.append("(").append(S(n-1, m)).append(")").append(An(n)).append("+" + (m-n+1)); return sb; } private static StringBuffer An(int n){ StringBuffer sb = A(n); while(n-- > 0) sb.append(")"); return sb; } private static StringBuffer A(int n){ StringBuffer sb = new StringBuffer(); if(n == 1) sb.append("sin(1"); else sb.append(A(n-1)).append(n%2==1 ? "+" : "-").append("sin("+n); return sb; } }
0.0分
3 人评分