codeforces520B-Two Buttons

题目已经写过很多次了,但是还是写错.记下来引以为戒.

题目大意,给定两个数a,b,通过两种操作将a变成b

一种是将a乘以2,一种是将a减1

这里可以用贪心的思路做,强行bfs搜也是可以,但是数据一大就容易T

首先如果a>b那么必然是直接减,因为变小的操作只有减

如果a<b那么有两种情况.如果b是奇数,那么必然最后一步是减操作,我们可以确定,因此可以先加回去b变成b+1

如果是偶数,那么必然最后一步是乘以2也可以还原,把b变成b/2

直到操作到b<=a的时候结束,结尾加上abs(a-b)就是全部的步骤数量,

思考的方式其实是倒着做,并不是用a去靠近b.而是用b去凑回a

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
int a,b,ans;
int main()
{
    std::ios::sync_with_stdio(false);
    //freopen("1.txt","r",stdin);
    cin>>a>>b;
    if(a>b)
        ans=a-b;
    else {
        while(a<b){
            if(b%2){
                ans++;
                b++;
            }
            else {
                ans++;
                b/=2;
            }
        }
        ans+=abs(a-b);
    }
    cout<<ans<<endl;
    return 0;
}


### Codeforces Problem 976C Solution in Python For solving problem 976C on Codeforces using Python, efficiency becomes a critical factor due to strict time limits aimed at distinguishing between efficient and less efficient solutions[^1]. Given these constraints, it is advisable to focus on optimizing algorithms and choosing appropriate data structures. The provided code snippet offers insight into handling string manipulation problems efficiently by customizing comparison logic for sorting elements based on specific criteria[^2]. However, for addressing problem 976C specifically, which involves determining the winner ('A' or 'B') based on frequency counts within given inputs, one can adapt similar principles of optimization but tailored towards counting occurrences directly as shown below: ```python from collections import Counter def determine_winner(): for _ in range(int(input())): count_map = Counter(input().strip()) result = "A" if count_map['A'] > count_map['B'] else "B" print(result) determine_winner() ``` This approach leverages `Counter` from Python’s built-in `collections` module to quickly tally up instances of 'A' versus 'B'. By iterating over multiple test cases through a loop defined by user input, this method ensures that comparisons are made accurately while maintaining performance standards required under tight computational resources[^3]. To further enhance execution speed when working with Python, consider submitting codes via platforms like PyPy instead of traditional interpreters whenever possible since they offer better runtime efficiencies especially important during competitive programming contests where milliseconds matter significantly.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值