【CODEFORCES】 C. 24 Game

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 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 ≤ 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 following n - 1 lines print the required operations an operation per line. Each operation should be in form: "a op b = c". Where a and b 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 of c mustn't be greater than 10¹⁸. 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 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

题解：首先 1,2,3肯定无法凑出24，其次，因为24 * 1 = 24，且n=4的时候一定能凑出24，所以4+2k的所有数都能凑出24，（k为正整数）。而对于奇数，我们发现n=5的时候也能凑出24，所以可知5+2k的所有数也能凑出24（k为正整数）。这样我们得出结论：n>=4的时候都可以凑出24，n<4的数都无法凑出24。

#include <iostream>
#include <cstdio>

using namespace std;

int n;
int main()
{
    scanf("%d",&n);
    if (n<4)
    {
        cout <<"NO"<<endl;
        return 0;
    }
    else
    {
        cout <<"YES"<<endl;
        if (n%2==0)
        {
            int i=n;
            while (i>4)
            {
                printf("%d - %d = %d\n",i,i-1,1);
                i=i-2;
            }
            printf("2 * 3 = 6\n");
            printf("6 * 4 = 24\n");
            for (int i=1;i<=(n-4)/2+1;i++) printf("24 * 1 = 24\n");
        }
        else
        {
            int i=n;
            while (i>5)
            {
                printf("%d - %d = %d\n",i,i-1,1);
                i=i-2;
            }
            printf("1 + 5 = 6\n");
            printf("6 * 3 = 18\n");
            printf("18 + 2 = 20\n");
            printf("20 + 4 = 24\n");
            for (int i=1;i<=(n-5)/2;i++) printf("24 * 1 = 24\n");
        }

    }
    return 0;
}