ural 1149. Sinus Dances dfs
来源:互联网 发布:Java凸包算法 编辑:程序博客网 时间:2024/05/18 06:30
1149. Sinus Dances
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
Let An = sin(1–sin(2+sin(3–sin(4+…sin(n))…)
Let Sn = (…(A1+n)A2+n–1)A3+…+2)An+1
For given N print SN
Let Sn = (…(A1+n)A2+n–1)A3+…+2)An+1
For given N print SN
Input
One integer N. 1 ≤ N ≤ 200
Output
Line containing SN
Sample
3
((sin(1)+3)sin(1–sin(2))+2)sin(1–sin(2+sin(3)))+1
Problem Author: Vladimir Gladkov
Problem Source: Ural Collegiate Programming Contest, April 2001, Perm, Test Round
import java.io.BufferedReader;import java.io.InputStream;import java.io.InputStreamReader;import java.io.PrintWriter;import java.math.BigInteger;import java.util.LinkedHashMap;import java.util.Map;import java.util.StringTokenizer;public class Main {public static void main(String[] args) {new Task().solve();}}class Task {InputReader in = new InputReader(System.in);PrintWriter out = new PrintWriter(System.out);String A(int step , int n){if(step == n){return "sin("+n+")" ;}return "sin(" + step + ((step%2==1)?"-":"+") + A(step+1 ,n) + ")" ;}String A(int n){return A(1 , n) ;}String S(int step , int n){if(step == n){return "sin(1)+" + n + "" ;}return "(" + S(step+1 , n) + ")" + A(n+1-step) + "+" + step ;}String S(int n){return S(1 , n) ;}void solve() {out.println(S(in.nextInt())) ;out.flush() ;}}class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = new StringTokenizer("");}private void eat(String s) {tokenizer = new StringTokenizer(s);}public String nextLine() {try {return reader.readLine();} catch (Exception e) {return null;} }public boolean hasNext() {while (!tokenizer.hasMoreTokens()) {String s = nextLine();if (s == null)return false;eat(s);}return true;}public String next() {hasNext();return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}public int[] nextInts(int n) {int[] nums = new int[n];for (int i = 0; i < n; i++) {nums[i] = nextInt();}return nums;}public long nextLong() {return Long.parseLong(next());}public double nextDouble() {return Double.parseDouble(next());}public BigInteger nextBigInteger() {return new BigInteger(next());}}
阅读全文
0 0
- ural 1149. Sinus Dances dfs
- Ural 1149. Sinus Dances
- timus 1149. Sinus Dances URAL 解题报告
- Timus 1149. Sinus Dances 打印复杂公式
- ural 1033. Labyrinth(dfs)
- ural 1171 DFS+DP
- URAL 1033 Labyrinth(DFS)
- ural 1119. Metro DFS
- ural 1033. Labyrinth dfs
- URAL 1033 Labyrinth (DFS)
- URAL 1242 Werewolf (DFS)
- URAL.1033 Labyrinth (DFS)
- ural 1033. Labyrinth dfs
- ural 1224. Spiral dfs
- Ural 1060. Flip Game dfs
- URAL 1298. Knight(DFS)
- URAL 1298 knight dfs搜索
- URAL 1022 Genealogical Tree (DFS)
- 火狐浏览器中函数获取event的对象
- 流程图绘制心得
- 时间相关工具类
- 论文阅读:《神经机器翻译和序列对序列模型:一个教程》上
- 2017年6月百度前端实习生面试问题
- ural 1149. Sinus Dances dfs
- 操作系统基础之设备管理
- 最新版idea2017+kemulator搭建J2ME开发环境
- R极简教程-8:缺失值与异常值
- STM32 大小端模式 与 堆栈及其增长方向分析
- 把本地仓库的内容推送到GitHub仓库报错:Permission denied (publickey).
- [bzoj4849]Mole Tunnels
- 文件系统
- 字符、字节