A10462 | Rebus
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer $n$ . The goal is to replace each question mark with some positive integer from $1$ to $n$ , such that equality holds.
输入格式
The only line of the input contains a rebus. It's guaranteed that it contains no more than $100$ question marks, integer $n$ is positive and doesn't exceed $1000000$ , all letters and integers are separated by spaces, arithmetic operations are located only between question marks.
输出格式
The first line of the output should contain "Possible" (without quotes) if rebus has a solution and "Impossible" (without quotes) otherwise.
If the answer exists, the second line should contain any valid rebus with question marks replaced by integers from $1$ to $n$ . Follow the format given in the samples.
If the answer exists, the second line should contain any valid rebus with question marks replaced by integers from $1$ to $n$ . Follow the format given in the samples.
输入输出样例
输入 #1
? + ? - ? + ? + ? = 42
输出 #1
Possible 9 + 13 - 39 + 28 + 31 = 42
输入 #2
? - ? = 1
输出 #2
Impossible
输入 #3
? = 1000000
输出 #3
Possible 1000000 = 1000000
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted