Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
19:23:00
Register now »
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
+14
Congratulations! |
|
+3
'You solved 245 tasks (117 is 800 rated, 14 is 900 rated, but for your rating 1400 you solved 4 problems).' I was solving very many 800 problems back in the day, and now I'm not upsolving, so I'm only upsolving in rounds. 'you solved E: Idiot First Search. You made submissions in: Feb/15/2026 21:05UTC+5 C++, then Feb/15/2026 21:07UTC+5 Python.' This is because I got WA, fixed it in 2 mins, and accidently submitted it in another lang. |
|
0
wdym "big bro" |
|
0
Congrats brooo :) |
|
0
43 :( I suck at math |
|
0
Bro how do you know all of that? |
|
0
Cuz I use Python for easy problems to code faster, and C++ for problems with more complex topics, such as graphs (because of recursion limits) |
|
+1
Thank you guys all! I'll surely keep going. |
|
0
You can still do it in O(n) by precalcing the array a, where a[i] is a result of a process -- dividing a[i] by 2 while possible. It can be done with some sort of dp: if i is odd, a[i]=i, else a[i]=a[i/2] |
|
+5
will there be contest 2? |
|
+15
I participated in the last Div3, and I will just say that it was easier then usual (except for hacks on problems B and E). I guess there are some cheaters, as always, but in general it's just people getting better at CP + rounds are easier idk |
|
0
this post is close to 2026 upvotes |
|
0
D1. Increments (easy version) Input: integers n, k (1 <= n, k <= 3) Output: an equation that consists of 1 integer k, some integers 1, and + symbol that is equal to n. D2. Increments (hard version) The same, but n, k <= 20. Sample: 5 2 Output: 2+1+1+1=5 actually, these should be H1 and H2 |
|
0
test results are crazy |
|
0
DONT OPEN THIS |
|
+1
omg its cool actually |
|
-15
WHAT THE HECK IT IS UNRATED |
|
0
|
|
0
Proof_by_QED orz sum orz |
|
0
cry oworz |
|
+8
Okay, many thanks! |
|
+8
I liked this type of editorials. I want editorial like this for every round. aryanc403 orz |
|
0
Maybe its not full schedule, maybe there will be a round between 3rd and 14th. But codeforces' ratio is 3 rounds/15 days, so I think no. |
|
0
1,3,6 |
|
0
|
|
0
Tysm!! |
|
0
Thank you. |
|
+1
Did anyone note "coordinatORZ"? |
|
0
Why my code 274894324 is getting WA on E? I did all exactly as in editorial |
|
0
Hope to reach pupil after this (to solve >= 5 problems) |
|
0
Announcement with a meme at the beginning? Something new... (for me) |
|
0
ty for fast editorial) |
|
0
Thanks for the fast text editorial! :D |
|
+14
Yes, just decrease your rating |
|
0
Pupil by 1 September 2023 |
|
0
I got 1010. It's beautiful like 888 :). |
|
0
I am going to lose my 888... and get 999 or 1111. :P |
|
+4
B. Date Input: no input Output: the date of first div10 round in DDMMYYYY format. |
|
+6
omeganot will play hsr! |
|
+9
I use CLion by JetBrains. I love JetBrains IDE (PyCharm, IntelliJ Idea, CLion) |
|
+3
HAPPY NEW YEAR TO YOU ALL!!! |
|
0
WE_NO_LONGER_LOVE_VALYA_WE_LOVE_SVETA |
|
0
Happy New Year!!!!! 2023 |
|
0
AAwwoooo!! Cool drawing <3 |
|
0
Another one "thank you"... |
|
+5
Cool drawing, Heap_OverFlow! |
|
0
you are cyan!!! |
|
-8
orz orz zhoukangyang orz |
|
+1
c0def0rces! |
