zoukankan      html  css  js  c++  java
  • Codeforces469C——构造——Game

    Little X used to play a card game called "24 Game", but recently he has found it too easy. So he invented a new game.

    Initially you have a sequence of n integers: 1, 2, ..., n. In a single step, you can pick two of them, let's denote them a and b, erase them from the sequence, and append to the sequence either a + b, or a - b, or a × b.

    After n - 1 steps there is only one number left. Can you make this number equal to 24?

    Input

    The first line contains a single integer n(1 ≤ n ≤ 105).

    Output

    If it's possible, print "YES" in the first line. Otherwise, print "NO" (without the quotes).

    If there is a way to obtain 24 as the result number, in the following n - 1 lines print the required operations an operation per line. Each operation should be in form: "aopb = c". Where a and b are the numbers you've picked at this operation; op is either "+", or "-", or "*"; cis the result of corresponding operation. Note, that the absolute value of c mustn't be greater than 1018. The result of the last operation must be equal to 24. Separate operator sign and equality sign from numbers with spaces.

    If there are multiple valid answers, you may print any of them.

    Sample Input

    Input
    1
    Output
    NO
    Input
    8
    Output
    YES
    8 * 7 = 56
    6 * 5 = 30
    3 - 4 = -1
    1 - 2 = -1
    30 - -1 = 31
    56 - 31 = 25
    25 + -1 = 24
    /*
    构造出偶数和奇数的情况
    把其他都变成 i+1 - i - 1
    */
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    int main()
    {
        int n;
        while(~scanf("%d", &n)){
            if(n < 4) printf("NO
    ");
            else {
                printf("YES
    ");
                if(n % 2 == 1){
                    printf("4 - 2 = 2
    ");
                    printf("5 + 2 = 7
    ");
                    printf("7 + 1 = 8
    ");
                    printf("3 * 8 = 24
    ");
                    for(int i = 6; i <= n; i += 2)
                        printf("%d - %d = 1
    ", i + 1, i);
                    for(int i = 6; i <= n; i += 2)
                    printf("1 * 24 = 24
    ");
                }
                else {
                    printf("1 * 3 = 3
    ");
                    printf("2 * 4 = 8
    ");
                    printf("3 * 8 = 24
    ");
                    for(int i = 5; i <= n; i += 2)
                        printf("%d - %d = 1
    ", i + 1, i);
                    for(int i = 5; i <= n; i += 2)
                        printf("1 * 24 = 24
    ");
                }
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    jQuery之.on()方法
    18款 非常实用 jquery幻灯片图片切换
    jquery 处理字符串
    JS中document.createElement()用法及注意事项
    jquery 创建 SVG DOM 的处理方法
    jQuery append xmlNode 修改 xml 内容
    jQuery与XML
    浏览器中的XML与JavaScript
    DOM(文本对象模型)简介
    用jQuery 处理XML-- jQuery与XML
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4667533.html
Copyright © 2011-2022 走看看