Codeforces Round #268 (Div. 2)+24 Game__基礎題

來源:互聯網
上載者:User
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 ≤ 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: "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 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 test(s) input

1
output
NO
input
8
output
YES8 * 7 = 566 * 5 = 303 - 4 = -11 - 2 = -130 - -1 = 3156 - 31 = 25

25 + -1 = 24

解決方案:這題是一道找規律的題目。

code:

#include <iostream>#include<cstdio>#include<cstring>using namespace std;int main(){    long long n;   while(~scanf("%lld",&n)){    if(n<4){        printf("NO\n");    }    else{        printf("YES\n");        if(n%2==0){            printf("1 * 2 = 2\n");            printf("2 * 3 = 6\n");            printf("6 * 4 = 24\n");            for(long long i=5;i<=n;i+=2){                printf("%I64d - %I64d = 1\n",i+1,i);                if(i+2<=n)                printf("1 * %I64d = %I64d\n",i+2,i+2);                else{                    printf("1 * 24 = 24\n");                }            }        }        else{            printf("5 - 1 = 4\n");            printf("4 - 2 = 2\n");            printf("2 * 3 = 6\n");            printf("6 * 4 = 24\n");            for(long long i=6;i<=n;i+=2){                printf("%I64d - %I64d = 1\n",i+1,i);                if(i+2<=n)                printf("1 * %I64d = %I64d\n",i+2,i+2);                else{                    printf("1 * 24 = 24\n");                }            }        }    }   }    return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.