zoukankan      html  css  js  c++  java
  • 模拟 URAL 1149 Sinus Dances

    题目传送门

     1 /*
     2     模拟:找到规律分别输出就可以了,简单但是蛮有意思的
     3 */
     4 #include <cstdio>
     5 #include <algorithm>
     6 #include <cstring>
     7 #include <cmath>
     8 #include <string>
     9 using namespace std;
    10 
    11 const int MAXN = 2e2 + 10;
    12 const int INF = 0x3f3f3f3f;
    13 
    14 void print_An(int n)
    15 {
    16     for (int i=1; i<=n; ++i)
    17     {
    18         printf ("sin(%d", i);
    19         if (i < n)    printf ("%c", (i&1) ? '-' : '+');
    20     }
    21 
    22     for (int i=1; i<=n; ++i)    printf ("%c", ')');
    23 }
    24 
    25 void work(int n)
    26 {
    27     for (int i=1; i<n; ++i)    printf ("%c", '(');
    28     print_An (1);    printf ("%c%d", '+', n);
    29     for (int i=n-1, j=1; i>=1; --i)
    30     {
    31         printf ("%c", ')');    print_An (++j);
    32         printf ("%c%d", '+', i);
    33     }
    34     puts ("");
    35 }
    36 
    37 int main(void)        //URAL 1149    Sinus Dances
    38 {
    39     // freopen ("F.in", "r", stdin);
    40 
    41     int n;
    42     while (scanf ("%d", &n) == 1)
    43     {
    44         work (n);
    45     }
    46 
    47     return 0;
    48 }
    编译人生,运行世界!
  • 相关阅读:
    grafana邮箱配置
    grafana集群配置
    CentOS7 配置OOM监控报警
    Mycat使用配置实践
    CentOS7安装JAVA环境
    CentOS7安装MYCAT中间件
    CentOS7安装MySQL5.6
    Mockingbird
    堆的建立与功能实现
    Matlab解决线性规划问题
  • 原文地址:https://www.cnblogs.com/Running-Time/p/4644766.html
Copyright © 2011-2022 走看看