Блог пользователя Swayam78

Автор Swayam78, история, 14 месяцев назад, По-английски

First of all ,Don't get sad. CP is for Fun.

Today after the contest, I was seeing other peoples solution and got to know that chatgpt actually solved C & D,

I solved C , using greedy approach (set approach). Didn't solved D. Which was Considerably Hard problem. But I saw , people solved it using chatgpt. I am attaching link.

I was Very Disappointed to see this. But , There is nothing we can do.

I am Attaching chatgpt soln and exactly same soln used under 200 rank person.

Chatgpt Giving Correct D soln

Chatgpt Giving Correct C soln

Cheater Using Chatgpt soln for C

Same Cheater Submitting D using chatgpt

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

Автор Swayam78, история, 16 месяцев назад, По-английски
  • Проголосовать: нравится
  • -9
  • Проголосовать: не нравится

Автор Swayam78, история, 19 месяцев назад, По-английски

Here , u just have to take a = c^d ,Then check if it do satisy the condition or not , if it doesn't then cout -1 , else cout a.

Proof: In my solution (283677605) you only ever add a bit to a if exactly one of c and d contains that bit, otherwise you either get a contradiction on the spot, or you don't add the bit and move on

why is that If you add that bit to a then (looking just at that bit) a | b=1 and so 1−c=d . If you don't add that bit, then a & c=0 and so b=d . If neither b=d nor c ^ d=1 holds then you can't construct such a . Note that carrying over never happens throughout the process.

. You can skip the latter cases and check if that value of a works, at the end. This is exactly equivalent to setting a=c ^ d and checking if it works.

283646208

Полный текст и комментарии »

  • Проголосовать: нравится
  • +25
  • Проголосовать: не нравится