【反悔贪心】CF1278B CF11B

Problem - 1278B - Codeforces

题意：

思路：

 

Code：

#include <bits/stdc++.h>

#define int long long

using i64 = long long;

constexpr int N = 2e3 + 10;
constexpr int M = 2e3 + 10;
constexpr int mod = 998244353;
constexpr int Inf = 1e18;

void solve() {
	int a, b;
	std::cin >> a >> b;
	if (a > b) std::swap(a, b);
	int idx = 0;
	while(a < b || (a - b) % 2 == 1) idx ++, a += idx;
	std::cout << idx << "\n";
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t = 1;
	std::cin >> t;

    while (t--) {
        solve();
    }
    
    return 0;
}

 

Problem - 11B - Codeforces

题意：

思路：

 

Code：

#include <bits/stdc++.h>

#define int long long

using i64 = long long;

constexpr int N = 2e3 + 10;
constexpr int M = 2e3 + 10;
constexpr int mod = 998244353;
constexpr int Inf = 1e18;

void solve() {
	int x;
	std::cin >> x;
	if (x < 0) x = -x;
	int idx = 0;
	int sum = 0;
	while(sum < x || (sum - x) % 2 == 1) {
		idx ++;
		sum += idx;
	}
	std::cout << idx << "\n";
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t = 1;

    while (t--) {
        solve();
    }
    
    return 0;
}