BayHarborButcher's blog

By BayHarborButcher, history, 13 months ago, In English,

Hey Codeforces community,

You are invited to CodeChef December Cook-Off 2018 sponsored by ShareChat. This is a 2.5-hour competition with 5 problems and it’s open to programmers across the globe. The contest problems will be available in English, Hindi, Bengali, Russian, Mandarin and Vietnamese.

Participants will also be in the running for some exciting jobs at ShareChat — India’s fastest growing social network.

To apply, all you need to do is fill the application form on the contest page and participate in the December Cook-Off.

I hope you will join your fellow programmers and enjoy the contest problems. Joining me on the problem setting panel are:

  • Tester: DarkestLight (Mohammad Nematollahi)

  • Setter and Editorialist: Tomah4wk (Hussain Kara Fallah)

  • Statement Verifier: Xellos (Jakub Safin)

  • Mandarin Translator: huzecong (Hu Zecong)

  • Vietnamese Translator: Team VNOI

  • Russian Translator: Fedosik (Fedor Korobeinikov)

  • Bengali Translator: solaimanope (Mohammad Solaiman)

  • Hindi Translator: Akash Shrivastava

Contest Details:

  • Start Date & Time: 23rd December 2018 (2130 hrs) to 24th December 2018 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone

  • Contest link: https://www.codechef.com/COOK101

  • Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.

  • Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu

(For those who have not yet got their previous winning, please send an email to winners@codechef.com)

Good Luck!

Hope to see you participating!!

Happy Programming!!

Read more »

 
 
 
 
  • Vote: I like it
  • +45
  • Vote: I do not like it

By BayHarborButcher, history, 15 months ago, In English,

Hi

I have many contests in some group made for training, each of these contests consist of some old CF rounds. These contests are all mash-ups. Today I was opening one of these contests and codeforces tells me that he can't read any of the problems descriptors. Not only that, all the contests I created have the same problem.

Is that a result of some update to the system or what exactly?

Read more »

 
 
 
 
  • Vote: I like it
  • +20
  • Vote: I do not like it

By BayHarborButcher, history, 2 years ago, In English,

Hi

Can anybody please provide a geometry playlist (contest) covering simple and basic concepts in 2D geometry. I would be really grateful if anybody could provide a playlist used in his trainings or university or anywhere (it's preferred not to be random picked problems)

Thanks in advance

Read more »

 
 
 
 
  • Vote: I like it
  • +40
  • Vote: I do not like it

By BayHarborButcher, history, 3 years ago, In English,

Hi all

I just sometimes don't understand, why people upvote some stuff. Some stuff posted by reds (having no purpose) just a red who wanted to post something and he gets hundreds of upvotes.

Like this one:

http://codeforces.com/blog/entry/52941

and wow +220 upvote.

ok he is a legendary guy with 5 times IQ as mine. But that post have nothing to do with the community, I mean there is something invented called personal blogs. winning the round doesn't make it awesome, you are awesome but the round being is relative.

I just have one question?

If I became red and had sex with a hot latina, and posted this here

How many upvotes I would get?

I don't care about contribution, just want to know how things get upvoted.

Thanks all.

Read more »

 
 
 
 
  • Vote: I like it
  • +35
  • Vote: I do not like it

By BayHarborButcher, history, 3 years ago, In English,

Hello

After like more than one year of the new rating change formula , I observed some things that should be mentioned. I don't know if somebody else think of them as not fair.

When you are a div2 participant and you manage to get like a top 3 rank. Your rating is gonna go far like 2050-2100 (and I've encountered people with like 2150). The opposite goes the same , when you are like red or yellow and you finish a contest miserably your rating will change by (-200 , -300 even more). My rating was dropped by like 250 the last round :v . But on the other side there were contests that I got my rating increased because of the opposite effect (and still not finding it fair).

Like as I remember from the past (div1 : 1700) when you are a div2 contestant even if you manage to get 1st rank , your rating won't exceed 1750. the same applies to div1 when you are like the worst contestant in a round even if you are very good , your rating won't drop that much (it even underneath the div1 limit by a little gap).

I actually find this formula kind of unfair. If you are a coder who is expected to be ranked like (150-200) in a round. and you manage to be the 1st. It doesn't mean that you will be in the top 50 every single round. A lot of times luck does its job. Like I believe if tourist enters a combined round and submits a solution then his laptop broke and he skips the round he will go down to yellow :D. I saw a lot of people dropped very hard because they failed in a combined round and were gone to the bottom of the ranklist (that happened to me twice) , and once I jumped from the middle of Candidate to International (and I find this unfair).

The whole point is , if you are a div2 contestant and you get like 2100 after a perfect round , (there are people that I believe suffering in div1 to get that 2100) so you should compete against them to get it , not against div2 participants. The same applies for all colors (even if you're yellow and you did a perfect round like top 5 , It's not fair to go like 2500 in the same way) , Ok you should be rated as a grandmaster , but to go further you should proof that you are a grandmaster in few consecutive rounds. The same applies for dropping down.

I thought of sharing this here in CF , hope there are some people who agrees.

Read more »

 
 
 
 
  • Vote: I like it
  • +215
  • Vote: I do not like it

By BayHarborButcher, history, 3 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +230
  • Vote: I do not like it

By BayHarborButcher, history, 3 years ago, In English,

Hello

I believe that solving geometry problems makes a big challenge for a lot of people in competitive programming and I am one of them

I have been wondering if someone could share a book which is kind of good to master the basics ... (vector algebra , 2d geometry lines and points and stuff , polygons ... etc)

I don't know why searching for a geometry guide was really hard and I couldn't come up with a good book (most of them are really advanced)

Can somebody share the name of a nice book?

Read more »

 
 
 
 
  • Vote: I like it
  • +29
  • Vote: I do not like it

By BayHarborButcher, history, 3 years ago, In English,

Hi

Whenever you enter a virtual contest , you will find those green\grey guys who submit tourist codes or some red guy codes in 1 minute and lead the scoreboard?

does anybody know their purpose ? I thought of a lot of things but couldn't figure it out.

Read more »

 
 
 
 
  • Vote: I like it
  • +79
  • Vote: I do not like it

By BayHarborButcher, history, 4 years ago, In English,

Hi

I recently saw my rating decreased .... and some of my friends were affected too

Is it a new formula? or a bug?

Read more »

 
 
 
 
  • Vote: I like it
  • +120
  • Vote: I do not like it

By BayHarborButcher, history, 4 years ago, In English,

Hello

World Finals is about 30 hours ahead from now ...

Will there be an online mirror ??

Read more »

 
 
 
 
  • Vote: I like it
  • +35
  • Vote: I do not like it

By BayHarborButcher, history, 4 years ago, In English,

Hello

I need Help please in this graph problem

I think you all know the minimum path cover problem in a DAG

You are given a DAG and you have to compose it into K paths so that every vertex must belong to exactly one path

So you have to find a solution where K is minimum

This can be solved by maximum matching.

But what if the vertex can belong to more than one path in the composition ???

For further understanding ... let's imagine this DAG

1->2

2->3

4->2

2->5

The standard covering will give us 3 as a result (1->2->3 , 4 , 5)

But in this version the answer would be 2 (1->2->3 , 4->2->5)

Does anyone have any idea?

Thanks in advance

Read more »

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

By BayHarborButcher, history, 5 years ago, In English,

Hello

I noticed that Div1 contests problems' writers are trying to make div1A that kind that have an obstacle for the contestant.

555A - Case of Matryoshkas

you can notice that in yesterday's contest (for who participated)

the statement was very very cheesy so it was hard to realize what is the real target in the problem.

553B - Kyoya and Permutation

here we can notice that in div1B (but people said it was easier than A) but the statement was a problem too.

547A - Mike and Frog

here the task was very tricky and it was harder than div1A regular problems

536A - Tavas and Karafs

here it was really tricky too.

These are the last 4 div1 contests.

So what i wanna say is :

In the end it is a div2C problem ... so it isn't necessary to make it containing obstacles for div1.

Just make a div2C problem which isn't that hard to figure or solve.

It is just div2C i believe 80% of contestants in div1 must solve it.

I think all of you are thinking that if all contestants solved it easily then it is not proper for a div1 contest .

But i think if problems were sorted and clear and not "over-harded" it will be a more perfect contest.

Thanks.

Read more »

 
 
 
 
  • Vote: I like it
  • +102
  • Vote: I do not like it

By BayHarborButcher, 5 years ago, In English,

Hello

I am wondering why Div2 Contests are unrated for all of Div1 Contestants?

I mean they should be rated for Div1 contestants whose ratings are between 1700 and 2050 ( I mean candidate masters and masters )

Becuase most of them try to solve only the first 3 problems in Div1 Contests (which are C , D , E of div2)

So Why aren't Div2 Contests rated for them ( I mean Div2 Contests which happens without a Div1 ) ?

So they can participate every round ( either in Div2 or if there is a Div1 they participate with reds and international masters :D )

Because it's boring to wait for the next Div1 round .

Who agrees with me ?

Read more »

 
 
 
 
  • Vote: I like it
  • +19
  • Vote: I do not like it

By BayHarborButcher, 6 years ago, In English,

Hello

I need help in this problem which is kind of famous

Given N numbers N<=10^5 and Q Queries Q<=10^5 of the type:

Modify X , Y modify the Xth number into Y

Count X , Y count how many distinct integers are between the Xth number and the Yth number (inclusive)

actually i have seen this problem (or problems similiar) a lot on the internet

i searched but i didn't find any answer

so can you help me please??!!

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it