Ural 1149 - Sinus Dances
2014-01-15 16:04
260 查看
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
Problem Author: Vladimir Gladkov
Problem Source: Ural Collegiate Programming Contest, April 2001, Perm, Test Round
Let Sn = (…(A1+n)A2+n–1)A3+…+2)An+1
For given N print SN
Input
One integer N. 1 ≤ N ≤ 200Output
Line containing SNSample
input | output |
---|---|
3 | ((sin(1)+3)sin(1–sin(2))+2)sin(1–sin(2+sin(3)))+1 |
Problem Source: Ural Collegiate Programming Contest, April 2001, Perm, Test Round
// Ural Problem 1149. Sinus Dances // Verdict: Accepted // Submission Date: 15:58:23 15 Jan 2014 // Run Time: 0.093s // // 版权所有(C)acutus (mail: acutus@126.com) // 博客地址:http://www.cnblogs.com/acutus/ // [解题方法] // 简单字符串处理 // 注意:所有符号之间没有空格 #include<stdio.h> void An(int n) { int i; for(i = 1; i < n; i++) { printf("sin(%d", i); if(i%2) printf("-"); else printf("+"); } printf("sin(%d", n); for(i = 1; i <= n; i++) { printf(")"); } } void Sn(int n) { int i; for(i = 1; i < n; i++) { printf("("); } for(i = 1; i < n; i++) { An(i); printf("+%d)", n - i + 1); } An(n); printf("+1\n"); } void solve() { int N; scanf("%d", &N); Sn(N); } int main() { solve(); return 0; }
相关文章推荐
- Ural 1149. Sinus Dances
- 模拟 URAL 1149 Sinus Dances
- URAL 1149 Sinus Dances
- ural 1149. Sinus Dances
- ural 1149
- ural 1149. Sinus Dances dfs
- ural 1149【模拟】
- Timus 1149. Sinus Dances
- Timus 1149. Sinus Dances 打印复杂公式
- Timus 1149. Sinus Dances 打印复杂公式
- URAL 1935. Tears of Drowned (水)
- URAL 1120. Sum of Sequential Numbers (数学)
- URAL1018 Binary Apple Tree
- URAL 1721 Two Sides of the Same Coin(二分图匹配,输出匹配对象)
- ural 1022 Genealogical Tree
- URAL 1942 Attack at the Orbit
- Ural 1167 Bicolored Horses
- CVS (URAL 1992 可持久化的链表)
- POJ 1149 PIGS(最大流-Dinic)
- URAL2047 Maths (暴力打表 递推)