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?
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <Map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int t,i,n;
cin>>t;
if (t<=3)
{
printf("NO\n");
}
else
if (t==4)
{
printf("YES\n");
printf("2 * 4 = 8\n");
printf("3 * 8 = 24\n");
printf("1 * 24 = 24\n");
}
else
if (t==5)
{
printf("YES\n");
printf("5 - 2 = 3\n");
printf("3 + 3 = 6\n");
printf("4 * 6 = 24\n");
printf("1 * 24 = 24\n");
}
else
if (t>=6)
{
printf("YES\n");
printf("6 - 5 = 1\n");
printf("1 - 1 = 0\n");
for (i=7;i<=t;i++)
{
printf("0 * %d = 0\n",i);
}
printf("2 * 3 = 6\n");
printf("4 * 6 = 24\n");
printf("0 + 24 = 24\n");
}
return 0;
}

5140

被折叠的 条评论
为什么被折叠?



