20241009日常训练

简单四则运算

#include<bits/stdc++.h>
using namespace std;
stack<int> num;
stack<char> op;
void eval()
{
    auto b = num.top(); num.pop();
    auto a = num.top(); num.pop();
    auto c = op.top(); op.pop();
    int x;
    if (c == '+') x = a + b;
    else if (c == '-') x = a - b;
    else if (c == '*') x = a * b;
    else x = a / b;
    num.push(x);
}

int solution(string str)
{
    unordered_map<char, int> pr{{'+', 1}, {'-', 1}, {'*', 2}, {'/', 2}};
    
    for (int i = 0; i < str.size(); i++)
    {
        auto c = str[i];
        if (isdigit(c))
        {
            int x = 0, j = i;
            while (j < str.size() && isdigit(str[j])) x = x * 10 + (str[j++] - '0');
            i = j - 1;
            num.push(x);
        }
        else if (c == '(') op.push(c);
        else if (c == ')')
        {
            while (op.top() != '(') eval();
            op.pop();
        }
        else
        {
            while (op.size() && pr[c] <= pr[op.top()]) eval();
            op.push(c);
        }
    }
    while (op.size()) eval();
    int ans = num.top();
    num.pop();
    return ans;
}
int main(){
    cout << solution("1+1") << endl;
}

计算x到y最短距离

代码：

#include<bits/stdc++.h>
using namespace std;
#define int  long long
int solution(int xx,int yy) {
	int d = yy - xx;
	int x = 1;
	while(x * (x + 1) < d)x ++;
	if(x * x >= d)x = 2 * x - 1;
	else x *= 2;
	return x;
}
signed main(){
	cout << solution() << endl;
}