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

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

Asking genuine doubts is a fault on Codeforces?? Or they become a source of mockery.

This guy NeverCompromise literally mocked on this blog .

If you do not want to answer such doubts, please don't just ignore, what sense does it makes by mocking other?? These kind of people should be banned I firmly believe. This is a Codeforces Community to learn and grow I presume, not source of entertainment when someone is seriously asking something.

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

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

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

Altho, there are many blogs out there on this, but I may not know it. Making it very simple and straightforward. Here it goes,

1: What all concepts should I have grip upon to become expert.

2: I know there is no substitute to practice, but how to practice? Should I solve problems according to ratings, or according to tags?

3: Can you share relevant resources. If there already exist such blog, please share.

I hope it helps me and others.

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

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

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

Can someone help me with Step-2 C: Very Easy Task

Problem Link : https://mirror.codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/C

My Approach: if the task can be done in T time, then 1(good) else 0 (bad). So, making 1 copy of the original document will take min(x,y) time, and then both copy machines can simultaneously work.

we need to check whether n copies can be made in T time or not, if I am updating T1 = T-min(x,y) and then checking that can I make n-1 copies in T1 time. Then find the first occurrence of 1 using binary search. It is throwing me an error "Wrong Answer on test case 5"

Code

Actual Approach : we need to check whether n-1 copies can be made in T time or not. Then, by using binary search find the first occurrence of 1 as it will be the least time to make n-1 copies, and then adding min(x,y) as it will be the time to make the copy of original.

AC Code

I dont know, where am I making mistake, both logics seems similar to me.

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

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

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

Can someone help me with Step-2 C: Very Easy Task

Problem Link : https://mirror.codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/C

My Approach: if the task can be done in T time, then 1(good) else 0 (bad). So, making 1 copy of the original document will take min(x,y) time, and then both copy machines can simultaneously work.

we need to check whether n copies can be made in T time or not, if I am updating T1 = T-min(x,y) and then checking that can I make n-1 copies in T1 time. Then find the first occurrence of 1 using binary search. It is throwing me an error "Wrong Answer on test case 5"

Code

Actual Approach : we need to check whether n-1 copies can be made in T time or not. Then, by using binary search find the first occurrence of 1 as it will be the least time to make n-1 copies, and then adding min(x,y) as it will be the time to make the copy of original.

AC Code

I dont know, where am I making mistake, both logics seems similar to me.

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

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

Автор Kanao, история, 4 года назад, По-английски

Hola Amigos ! I am a beginner and stuck with a Assiut University Training-Newcomers ques. https://mirror.codeforces.com/group/MWSDmqGsZm/contest/219158/problem/O this ques. My Approach : I inputted it as a string and then run a loop to search for the operators but I am unable to keep track of the two numbers upon which I am supposed to used the operators , idk how am I supposed to do that with strings. All suggestions and different approaches are welcomed. Thank-You

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

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