CF_469C_24Game

C. 24 Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 thema and b, erase them from the sequence, and append to the sequence eithera + b, or a - b, or a × b.

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

Input

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

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 followingn - 1 lines print the required operations an operation per line. Each operation should be in form: "aop b =c". Where a andb are the numbers you've picked at this operation;op is either "+", or "-", or "*";c is the result of corresponding operation. Note, that the absolute value ofc mustn't be greater than 10¹⁸. The result of the last operation must be equal to24. Separate operator sign and equality sign from numbers with spaces.

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

Sample test(s)

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

这题目看下数据量，感觉学过的方法都不能用

所以这应该是一道模拟，找规律的问题

而且这个问题给的条件过于宽松了

要考虑的情况也过于多……

突然间机智的想到，每四个相邻的数可以构成一个0

于是只要前面的解能处理4的所有余数的情况即0,1,2,3

即可得解

n>=3的情况最大只能出现9

而4 1*2*3*4=24

   5  （5-1-2）*3*4=24

   6  2*3*4+1+5-6=24

   7  1*（2+3）*4+5+6-7=24

于是所有情况可以得解，下面代码应该还可以简洁很多

#include <iostream>
#include <stdio.h>
using namespace std;

typedef long long LL;

const int M=10005;

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n<=3)
        {
            printf("NO\n");
            continue;
        }
        printf("YES\n");
        if(n%2==0)
        {
            if((n-4)%4==0)
            {
                printf("1 * 2 = 2\n");
                printf("2 * 3 = 6\n");
                printf("6 * 4 = 24\n");
                for(int i=5;i<=n;i+=4)
                {
                    printf("%d - %d = %d\n",i,i+1,-1);
                    printf("%d - %d = %d\n",i+3,i+2,1);
                    printf("1 + -1 = 0\n");
                    printf("24 + 0 = 24\n");
                }
            }
            else
            {
                printf("2 * 3 = 6\n");
                printf("6 * 4 = 24\n");
                printf("1 + 24 = 25\n");
                printf("25 + 5 = 30\n");
                printf("30 - 6 = 24\n");
                for(int i=7;i<=n;i+=4)
                {
                    printf("%d - %d = %d\n",i,i+1,-1);
                    printf("%d - %d = %d\n",i+3,i+2,1);
                    printf("1 + -1 = 0\n");
                    printf("24 + 0 = 24\n");
                }
            }
        }
        else
        {
            if((n-5)%4==0)
            {
                printf("4 * 5 = 20\n");
                printf("1 - 2 = -1\n");
                printf("3 - -1 = 4\n");
                printf("4 + 20 = 24\n");
                for(int i=6;i<=n;i+=4)
                {
                    printf("%d - %d = %d\n",i,i+1,-1);
                    printf("%d - %d = %d\n",i+3,i+2,1);
                    printf("1 + -1 = 0\n");
                    printf("24 + 0 = 24\n");
                }
            }
            else
            {
                printf("2 + 3 = 5\n");
                printf("4 * 5 = 20\n");
                printf("20 * 1 = 20\n");
                printf("20 + 5 = 25\n");
                printf("25 + 6 = 31\n");
                printf("31 - 7 = 24\n");
                for(int i=8;i<=n;i+=4)
                {
                    printf("%d - %d = %d\n",i,i+1,-1);
                    printf("%d - %d = %d\n",i+3,i+2,1);
                    printf("1 + -1 = 0\n");
                    printf("24 + 0 = 24\n");
                }
            }
        }

    }
    return 0;
}