Comments
0

100% same, as i mentioned

0

Weird Issue !!!!!!!

Please Clarify...

For problem F(Morning Walk), these two submission are 100% same with each other...

Still one Accepted (354578398) and one is wrong (354574900)

!!!!!!!!!!!!!!!!!!

even if Precision Error occurs then why not for both?
0

vector sort is faster than set. nothing else
0

i did it too afterwards
+1

my concern is, why is this happening!!
0

do not sneak into Messages

-10

Chess
0

Problem J:

What is C, and why it is 200? how we get it?
0

Great effort!! [ You & your efforts inspired me a lot.]

You may add tutorial and source code for the problems listed in each sub-section. It can be kept open to contribute the Source codes. (Just a suggestion from a Newbie).
On night.watchman → CP vs Chess, 2 years ago
+3

how do you manage both?
On night.watchman → CP vs Chess, 2 years ago
0

Do you play chess regularly?

On night.watchman → CP vs Chess, 2 years ago
0

some 1+0?
On night.watchman → CP vs Chess, 2 years ago
0

You're an IM. Chess obviously should be easy for you, at least to certain level.

On night.watchman → CP vs Chess, 2 years ago
+1

doesn't matter. still you're our(me and The_crawler) hero
On night.watchman → CP vs Chess, 2 years ago
0

cool stuffs!
On night.watchman → CP vs Chess, 2 years ago
+6

WOW. Decent enough in both fields.

Just from curiosity, which field feels a bit complex and hard to you?
On night.watchman → CP vs Chess, 2 years ago
0

interesting!!

On night.watchman → CP vs Chess, 2 years ago
+3

Owh a red commented on my blog!!!

Just from curiosity, does Chess feel a bit complex to you or don't you spent enough time on chess? in general, i saw people with lower CF rating and higher Chess rating.

On night.watchman → CP vs Chess, 2 years ago
+1

Have you played any FIDE tournament?

On night.watchman → CP vs Chess, 2 years ago
0

Make it through!
On night.watchman → CP vs Chess, 2 years ago
0

Wow. Really cool!!
On night.watchman → CP vs Chess, 2 years ago
+1

Great
On night.watchman → CP vs Chess, 2 years ago
+1

I was also looking for Fabiano Caruana. He was decent in this tournament but sadly not enough.

+4

Thanks for fast editorial

+6

Thanks Setters & Testers
0

but we take that lovely little ' ! '
+6

i'm not in, just here for my teammates The_crawler and Knightshade
0

help in problem C

here L = k * a^x * b^y, so, K must be a divisor of L. Now i need to check which of the divisors can be represented in (a^x*b^y) and count them. What is wrong with this idea? i think it shouldn't give TLE. My Source Code (WA on test 2)
On pinely → Pinely Round 2, 3 years ago
+12

pinely round 1
0

problem B

accepted code give output 29 for this input.( 88 2588) but i guess this should be 28. please make me understand.

upd: ok understood

0

i don't get how this website works
0

i got your approach thankfully. but shouldn't we count this 32 for every permutations of array a?
0

problem C: (DIV 2) Test Case 1: Why the answer is 32 ? Why not factorial 6 * 32 ??

-8

Magnus doesn't care!