We will hold 【MX-J2】Mengxiong Weekly (Open) on Luogu. This is a Div. 3 round provided by our collaborator. If you cannot understand Chinese, ChatGPT may be helpful.↵
↵
- Contest URL: <https://www.luogu.com.cn/contest/186933> ↵
- Start Time: <https://www.timeanddate.com/worldclock/fixedtime.html?msg=MX-J2&iso=20240804T1330&p1=237> ↵
- Duration: 210 minutes ↵
- System: IOI ↵
- Difficulty: CSP-J (see this [blog](https://codeforces.net/blog/entry/131266)), easier than Codeforces Div. 3 (but still harder than Div. 4) ↵
- Writer & Tester: [user:zltzlt,2024-07-31], [user:sinsop90,2024-07-31], [user:qwqwf,2024-07-31], [user:cyh_toby,2024-07-31] ↵
- Rated range: **Unrated on Luogu** ↵
- The points value: 100-100-100-100-100 ↵
↵
We are looking forward to your participation! If you cannot understand Chinese, ChatGPT may be helpful. We are working on establishing an English platform, but it takes time. We plan to complete this task by the end of 2024 or early 2025.↵
↵
- [A tutorial on using Luogu](https://codeforces.net/blog/entry/131261) ↵
- [A brief introduction to Chinese NOI](https://codeforces.net/blog/entry/131266)
↵
- Contest URL: <https://www.luogu.com.cn/contest/186933> ↵
- Start Time: <https://www.timeanddate.com/worldclock/fixedtime.html?msg=MX-J2&iso=20240804T1330&p1=237> ↵
- Duration: 210 minutes ↵
- System: IOI ↵
- Difficulty: CSP-J (see this [blog](https://codeforces.net/blog/entry/131266)), easier than Codeforces Div. 3 (but still harder than Div. 4) ↵
- Writer & Tester: [user:zltzlt,2024-07-31], [user:sinsop90,2024-07-31], [user:qwqwf,2024-07-31], [user:cyh_toby,2024-07-31] ↵
- Rated range: **Unrated on Luogu** ↵
- The points value: 100-100-100-100-100 ↵
↵
We are looking forward to your participation! If you cannot understand Chinese, ChatGPT may be helpful. We are working on establishing an English platform, but it takes time. We plan to complete this task by the end of 2024 or early 2025.↵
↵
- [A tutorial on using Luogu](https://codeforces.net/blog/entry/131261) ↵
- [A brief introduction to Chinese NOI](https://codeforces.net/blog/entry/131266)