CF 268C 24 Game
来源:互联网 发布:达观数据公司简介 编辑:程序博客网 时间:2024/05/16 03:10
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?
The first line contains a single integer n(1 ≤ n ≤ 105).
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 1018. 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.
1
NO
8
YES8 * 7 = 566 * 5 = 303 - 4 = -11 - 2 = -130 - -1 = 3156 - 31 = 2525 + -1 = 24
刚拿到题目觉得完全没有思路。其实后来发现就像脑筋急转弯。
手动前几组
1:NO
2:NO
3:NO
4:YES 24=1*2*3*4
5:YES 24=3*4*(5-2-1)
6:YES 24=(6-5)*(1*2*3*4)
7:YES 24=(7-6)*[3*4*(5-2-1)]
8:YES 24=(8-7)*(6-5)*(1*2*3*4)
9:YES 24=(9-8)*(7-6)*[3*4*(5-2-1)]
……
#include<cstdio>using namespace std;int N;void work(){if(N<=3){printf("NO\n"); return;}printf("YES\n");if(N%2==0){printf("1 * 2 = 2\n");printf("3 * 2 = 6\n");printf("4 * 6 = 24\n");for(int i=5;i<=N;i+=2){printf("%d - %d = 1\n",i+1,i);printf("1 * 24 = 24\n");}return;}if(N%2==1){printf("3 * 4 = 12\n");printf("5 - 1 = 4\n");printf("4 - 2 = 2\n");printf("2 * 12 = 24\n");for(int i=6;i<=N;i+=2){printf("%d - %d = 1\n",i+1,i);printf("1 * 24 = 24\n");}return;}}int main(){//freopen("C.in","r",stdin);while(scanf("%d",&N)==1)work();//while(1);return 0;}
- CF 268C 24 Game
- CF 277C Game(博弈)
- cf 24 Game (观察+.. 想一想)
- CF 468A 24 Game
- CF 277C Game(NIM博弈)
- CF 245C Game with Coins
- CF 397 C. Table Tennis Game 2
- CF Game
- cf 468A 24 Game 构造
- CF 451 C Predict Outcome of the Game(数学题)
- <cf>Game on Paper
- CF:A. Flipping Game
- CF Bear and Game
- 【CF 534F】Game
- 【CODEFORCES】 C. 24 Game
- CF 256C Furlo and Rublo and Game【博弈论,SG函数】
- CF#319-C. Vasya and Petya's Game-猜数-数论
- CF 327A - Flipping Game
- Codeforces Round #268 (Div. 1) A
- ubuntu上安装lamp
- Android应用安全实践 -- 某些Android应用在客户端明文存储登录密码
- Codeforces Round #268 (Div. 2) C
- 2014 ACM/ICPC Asia Regional Guangzhou Online HDU 5024 Wang Xifeng's Little Plot
- CF 268C 24 Game
- C语言中的零长度数组使用说明
- HTML5推箱子机理实现
- 数据结构(C实现)------- 链栈
- OpenSSL RSA 用法
- 谈谈C++类型安全
- AOP技术应用和研究
- hdu 1711(kmp)
- 设计模式-缓存工厂模式代码构造