Comments
On marzipan → Good Bye 2023, 3 years ago
-19

same
+9

Canon round.
0

Man. Problem B turned out to be so easy, but I wasted all my time debugging solution for C.
0

Or something like this :)

Pattern example
0

Could you tell how please?
+10

I think that this round had very interesting problems with pretty beautiful possible solutions. Thanks for the contest!
0

The contest isn't over yet.
+1

Same lol
0

Dude, you are breaking the rules of the contest.
On tourist → Codeforces Round #850, 4 years ago
-6

Agreed.
On tourist → Codeforces Round #850, 4 years ago
0

How to solve the "Letter Exchange"?
0

Thanks! Didn't notice that it was already out.
0

What are the ideas behind D and F?
0

Ah, okay. Sorry.
0

It's not.
-7

Or ko_osaga ._.
0

Let's gooo!!
0

To be honest, there is not that much logic behind that. Was wondering, what would happen, and desided to try this dumb idea out...
+1

Wow. People hate this comment so much :/
0

Seems like checking if ( x & 1 || x & x >> 1 ) is false works too.
0

C is a harder version of https://codeforces.me/problemset/problem/1512/A
+8

Congrats
0

Didn't notice lol
-7

Noticed that in examples a and b are equal to x +- some number. Found such numbers using bruteforce for x in [1, 256] and found out that there is either no solution or at least one solution with x+-x/2.
0

Good job!)
-11

No. You just need to check if x is even and if (x + x/2) ^ (x/2) is equal to x. If both conditions are true, print x+x/2 and x/2 else -1.
+6

Finally I was able to use first 31 digits of pi from my template :D
+3

Please no NP-hard problems. Please no NP-hard problems. :D
+1

Bye bye my hopes and chances to become pupil...
0

First time in a while I was able to pass pretests on C and now the round is unrated :(
0

Friendships here are in fact subscriptions. If you want to subscribe to someone, press the grey star near their nickname in their profile.
+1

Hate permutations, hate sortings, hate myself. Goodbye chance to become pupil :(
0

OMG. Cyan round.
+16

What did I say wrong?
0

Well, I figured out how to use this website and now I am cyan... kind of... :D
+3

.​
+6

Thanks for fast editorial.
0

A was very easy, B is easy too if you know how to use Wolfram Alpha or are just good at finding patterns, but TL's at C and D suck.
0

Good luck!
0

Congrats!
On awoo → Codeforces Round #839 (Div. 3), 4 years ago
0

Alts/bots for bonus hacks.
On awoo → Codeforces Round #839 (Div. 3), 4 years ago
0

Could anybody explain to me why and how char in my A problem solution(185801559) turn into integer?
+23

0

The feeling when you screw up C for more than half an hour because you forgot how c++ grid coords work... again. And then I got late for 2-3 damn seconds. Hate myself...
0

Very interesting round. Can't wait for the editorial to see the D problem solution with diffrent numbers.
0

Dunno about the idea of the authors but I've came to a pretty beautiful solution with repeating any number if n is odd. (num ^ num ^ ... ^ num = num) and (num*n/n = num). And if number is even, you can just print 1, 3 and 2 (n — 2) times.
+1

Or long long
0

1 2 1 9

0 and 2 are valleys so the answer is "no", but your code says "yes".
+22

Pinely Round 1 (Div.0 + Div.1)
0

Yay. There is an editorial
0

I'm wondering if there will be an editorial for this.
0

Didn't solve even A :) Have the same feelings after this competition.
0

Just every single time I think that I can't get results worse than previous time, I somehow manage to do this anyway. At least the next competition is div 4 round...
+1

The feeling when Div. 3 round was more problematic for you than Div. 2 round XD
+4

What if it is my 5th rated round? Will I become trusted participant if I will solve a problem in it?
0

Current rating: 880, solved problems: 8.

My goals are to finally figure out how to compete on this website and to achieve cyan :)