659A - Round House
25 Dec 2020 — Tags: easy,modulo — URL \[a + b \mod n\]Time complexity: $O(1)$
Memory complexity: $O(1)$
Click to show code.
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main(void)
{
ios::sync_with_stdio(false), cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << (((a - 1 + b) % n) + n) % n + 1 << endl;
return 0;
}