Nebius Welcome Round (Div. 1 + Div. 2)

Nebius Welcome Round (Div. 1 + Div. 2)

link
注意到2 * n 圈的时候回到原点，所以只需要枚举1-2n即可

#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using i64 = long long;

const int N = 2e5 + 10;
i64 dp[N];

void solve() {
	i64 n, x, p;
	std::cin >> n >> x >> p;
	if (p >= 2 * n) {
		for (int i = 1; i <= n * 2; i ++) {
			if ((dp[i] + x) % n == 0) {
				std::cout << "Yes\n";
				return;
			}
		}
		std::cout << "No\n";
	}
	else {
		for (int i = 1; i <= p; i ++) {
			if ((dp[i] + x) % n == 0) {
				std::cout << "Yes\n";
				return;
			}
		}
		std::cout << "No\n";
	}

}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	for (i64 i = 1; i < N; i ++) {
		dp[i] = (i + 1) * i / 2;
	}

	int t = 1;
	std::cin >> t;

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

	return 0;
}
···