Codeforces Round #295 (Div. 2) -- B. Two Buttons (模拟)
来源:互联网 发布:淘宝兴业银行进不去 编辑:程序博客网 时间:2024/06/05 03:37
思路:只能对n进行减1和乘2的操作来得到m,模拟一下即可,我是将m进行加1和除2的操作得到n;
AC代码:
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm> #include <cmath>using namespace std;int main() {int n, m, ans;while(scanf("%d %d", &n, &m) != EOF) {if(m <= n) {printf("%d\n", n - m); continue;}ans = 0;while(n != m) {int p = (m + 1) / 2;if(p < n) {if(m & 1) ans++;ans += (n - p);ans++;break;}else if(p >= n) {if(m & 1) ans++;ans++;m = (m + 1) / 2;}}printf("%d\n", ans);}}
1 0
- Codeforces Round #295 (Div. 2) -- B. Two Buttons (模拟)
- Codeforces Round #295 (Div. 2) B. Two Buttons
- Codeforces Round #295 (Div. 2) B. Two Buttons
- B. Two Buttons(Codeforces Round #295(div2))
- Codeforces Round #295 B. Two Buttons
- Codeforces Round #164(Div. 2) B. Buttons【找规律】
- Codeforces #295(Div 2) A Pangram、B Two Buttons、C DNA Alignment
- CODEFORCES:B. Two Buttons
- Codeforces Round #323 (Div. 2) B 模拟
- Codeforces Round #362 (Div. 2) B 模拟
- Codeforces Round #315 (Div. 2) B 模拟
- Codeforces Round #105 (Div. 2) B 模拟
- Codeforces Round #392 (Div. 2)B (模拟)
- Codeforces 295 Div2 B.Two Buttons
- CodeForces 520 B.Two Buttons(bfs)
- Codeforces Round #256 (Div. 2) B. Suffix Structures(模拟)
- Codeforces Round #107 (Div. 2) B (简单模拟)
- Codeforces Round #265 (Div. 2) B. Inbox (100500)(模拟)
- Android中资源管理机制详细分析
- kbengine引擎的安装
- 可复用代码c++
- 安卓笔记---对话框中输入,判断是否符合号码规范,是--跳转拨号盘,否--提示号码不正确
- ubuntu adb 无法识别手机
- Codeforces Round #295 (Div. 2) -- B. Two Buttons (模拟)
- 趋势科技实习--3个tool的实现
- kbengine引擎登陆流程分析
- advertisement总结
- 10、Regular Expression Matching
- 让 python 命令行也自动补全
- javascript学习之函数章节
- MITx: 6.00.1x Alphabetical Substrings (python)
- POJ 2115解题报告