n, a, x, b, y = map(int, input().split())
while a != x and b != y:
if a == b:
print("YES")
exit(0)
if a == n and b == 1:
a = 1
b = n
elif a == n and b != 1:
a = 1
b -= 1
elif a != n and b == 1:
a += 1
b = n
else:
a += 1
b -= 1
if a == b:
print("YES")
exit(0)
print("NO")
// Problem: A. Circle Metro
// Contest: Codeforces - Codeforces Round #562 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1169/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, a, x, b, y;
cin >> n >> a >> x >> b >> y;
a--, x--, b--, y--;
while (true)
{
if (a == b) {
cout << "YES\n";
return 0;
}
if (a == x || b == y)
{
break;
}
a = (a + 1) % n;
b = (b - 1 + n) % n;
}
cout << "NO\n";
}1335A - Candies and Two Sisters | 96B - Lucky Numbers (easy) |
1151B - Dima and a Bad XOR | 1435B - A New Technique |
1633A - Div 7 | 268A - Games |
1062B - Math | 1294C - Product of Three Numbers |
749A - Bachgold Problem | 1486B - Eastern Exhibition |
1363A - Odd Selection | 131B - Opposites Attract |
490C - Hacking Cypher | 158B - Taxi |
41C - Email address | 1373D - Maximum Sum on Even Positions |
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |